Discrete Mathematics Questions and Answers – Logics – Tautologies and Contradictions

This set of Discrete Mathematics Questions and Answers for Experienced people focuses on “Logics – Tautologies and Contradictions”.

1. A compound proposition that is always ___________ is called a tautology.
a) True
b) False
View Answer

Answer: a
Explanation: Tautology is always true.

2. A compound proposition that is always ___________ is called a contradiction.
a) True
b) False
View Answer

Answer: b
Explanation: Contradiction is always false.

3. If A is any statement, then which of the following is a tautology?
a) A ∧ F
b) A ∨ F
c) A ∨ ¬A
d) A ∧ T
View Answer

Answer: c
Explanation: A ∨ ¬A is always true.
advertisement
advertisement

4. If A is any statement, then which of the following is not a contradiction?
a) A ∧ ¬A
b) A ∨ F
c) A ∧ F
d) None of mentioned
View Answer

Answer: b
Explanation: A ∨ F is not always false.

5. A compound proposition that is neither a tautology nor a contradiction is called a ___________
a) Contingency
b) Equivalence
c) Condition
d) Inference
View Answer

Answer: a
Explanation: Definition of contingency.

6. ¬ (A ∨ q) ∧ (A ∧ q) is a ___________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
View Answer

Answer: b
Explanation: ≡ (¬A ∧ ¬q) ∧ (A ∧ q)
≡ (¬A ∧ A) ∧ (¬q ∧ q)
≡ F ∧ F ≡ F.

7. (A ∨ ¬A) ∨ (q ∨ T) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
View Answer

Answer: a
Explanation: ≡ (A ∨ ¬A) ∨ (q ∨ T)
≡ T ∨ T ≡ T.
advertisement

8. A ∧ ¬(A ∨ (A ∧ T)) is always __________
a) True
b) False
View Answer

Answer: b
Explanation: ≡ A ∧ ¬ (A ∨ (A ∧ T))
≡ A ∧ ¬(A ∨ A)
≡ A ∧ ¬A ≡ F.

9. (A ∨ F) ∨ (A ∨ T) is always _________
a) True
b) False
View Answer

Answer: a
Explanation: ≡ (A ∨ F) ∨ (A ∨ T)
≡ A ∨ T ≡ T.
advertisement

10. A → (A ∨ q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
View Answer

Answer: a
Explanation: ≡ A → (A ∨ q)
≡ ¬A ∨ (A ∨ q)
≡ (A ∨ ¬A) ∨ q
≡ T ∨ q ≡ T.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Experienced people, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.