Discrete MathematicsPrepositional Logic (NTANET (Based on NTAUGC) Computer Science (PaperII)): Questions 1  5 of 25
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exampattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 1
» Discrete Mathematics » Prepositional Logic
Appeared in Year: 2015
Question
Consider the compound propositions given below as:
Which of the above propositions are tautologies? (December)
Choices
Choice (4)  Response  

a.  (1) and (3) 

b.  (2) and (3) 

c.  (1) and (2) 

d.  (1), (2) and (3) 

Question number: 2
» Discrete Mathematics » Prepositional Logic
Appeared in Year: 2015
Question
In Propositional Logic, given P and P→Q, we can infer……………. . (December)
Choices
Choice (4)  Response  

a.  Q 

b.  ~Q 

c.  P∧Q 

d.  ~P∧Q 

Question number: 3
» Discrete Mathematics » Prepositional Logic
Appeared in Year: 2012
Question
Skolmization is the process of (December Paper III)
Choices
Choice (4)  Response  

a.  bringing all the quantifiers in the beginning of a formula in FDL. 

b.  removing all the universal quantifiers. 

c.  removing all the existential quantifiers. 

d.  All of the above 

Question number: 4
» Discrete Mathematics » Prepositional Logic
Appeared in Year: 2013
Question
Let P (m, n) be the statement “m divides n” where the universe of discourse for both the variables is the set of positive integers. Determine the truth values of each of the following propositions:
I.
II. (December PaperII)
Choices
Choice (4)  Response  

a.  I – false & II – true 

b.  I and II are true 

c.  I – true & II – false 

d.  I and II are false 

Question number: 5
» Discrete Mathematics » Prepositional Logic
Appeared in Year: 2013
Question
Which of the following is a correct predicate logic statement for “Every Natural number has one successor”? (September PaperIII)
Choices
Choice (4)  Response  

a. 


b. 


c. 


d. 

