0% found this document useful (0 votes)
27 views2 pages

Discrete Mathematics

Dm

Uploaded by

90's Susi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views2 pages

Discrete Mathematics

Dm

Uploaded by

90's Susi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DISCRETE MATHEMATICS

_________________________________________________________
PART-A (1*6=6)
1. If the truth table of P is F then the truth value of ⅂P is
(a) F (b) T (c) F$T (d) None of these
2. Which one of the following is not a connective?
(a) = (b) → (c) ↔ (d) ∧
3. p↑q is equivalent is
(a) ( p ∧∼ q ) (b) ∼ ( p ∨q ) (c) ∼ ( p ∧q ) (d) (∼ p ∧∼ q ¿
4. ∼ ( p ⟹ q )=¿
(a) p ∧q (b) ∼ p ∧∼ q (c) ∼ p ∧q (d) p∧∼ q
5. Which of the following is a tautology
(a) P∨P (b) P∧P (c) P∧∼P (d) P∨∼P
6. The proposition P⟹q is equivalent to
(a) q⟹ p (b) q ⟹ ∼ p (c) ∼ p ⟹ q (d) None of these
PART-B (4*5=20)
7. (a) Construct the truth table for the logical statement
(i)(p↓ q ¿ ∧(p ↓ r ) (ii) p⇒ [ ( p ∨ r ) ∧ ∼ ( p ⟺ ∼ r )]
(OR)
(b)Prove that p⟹ ( q ∧ r ) ≡ ( p ⟹ q ) ∧ ( p ⟹ r )
Express p↑ q interms of ↓ only
8. Using truth table prove that ∼ ( p ∧q )=¿ (∼ p ∨∼ q ¿
Construct the truth table for p ⨁ q ⨁ r
(OR)
Show that [(p⟹ q ¿ ) ∧(q ⟹ r )¿ ⟹ (p ⟹ r )
Show that {↑ } is commutative but not associative
9. Show that p→ ( q ∨r ) ≡ ( p → q ) ∨ ( p → r )
Prove that P∧ ( P → Q ) ⟹ Q
(OR)
Show that p∨ ( q ∧r ) ≡ ( p ∨q ) ∧( p ∧r ) by a truth table
Define tautology by giving example
10. Prove ⅂(P→ Q¿ ⟺ P ∧⅂ Q (OR)
Show that (Q∨ P ∧⅂ Q ¿ ¿ ∨(⅂ P ∧⅂ Q) is a tautology
11. Prove that ∼ [ p → ( q ∧∼ r ) ] = p ∧[∼ ( q ∧∼ r ) ] by a truth table
Construct truth table for (P∨ q ¿ ∨⅂ P
Verify that the proposition (P∧Q ¿ ∧⅂ (P∧ Q) is a contradiction.
PART-C (8*3=24)
12. Describe the various connectives in mathematical logic(OR)
Define quantifiers
What are the types of quantifiers
State the properties of quantifers

13. Prove that ⅂(P∧Q ¿ → ¿


Show that (p∧ q ¿ ∧∼ ( p ∨q ) is a fallacy
14. Show that p follows from the arguments (∼ p ∨∼ q ¿ ⟹ ( r ∧ s ) , r ⟹t and ∼ r (OR)
Prove that conditional operation distribution over conjuction

You might also like