0% found this document useful (0 votes)
441 views41 pages

Discrete Mathematics MCQ'S: De-Morgan's Laws and Tautologies and Contradictions

1) The document discusses De Morgan's laws and their applications in determining logical equivalences and the negations of statements. 2) It also discusses tautologies, contradictions, and contingencies - definitions and examples of compound statements that are always true, always false, or may be either true or false. 3) Multiple choice questions with explanations are provided as examples of applying De Morgan's laws and identifying tautologies, contradictions, and contingencies.

Uploaded by

Asad Ali
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)
441 views41 pages

Discrete Mathematics MCQ'S: De-Morgan's Laws and Tautologies and Contradictions

1) The document discusses De Morgan's laws and their applications in determining logical equivalences and the negations of statements. 2) It also discusses tautologies, contradictions, and contingencies - definitions and examples of compound statements that are always true, always false, or may be either true or false. 3) Multiple choice questions with explanations are provided as examples of applying De Morgan's laws and identifying tautologies, contradictions, and contingencies.

Uploaded by

Asad Ali
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/ 41

Discrete Mathematics

MCQ’s (De-Morgan’s
Lawsand
Tautologies and
Contradictions)By
Muhammad Sohaib Yousaf
De-Morgan’s
Laws

Which of the following statements is the negation of the statements
“4 is odd or -9 is positive”?
a) 4 is even or -9 is not negative
b) 4 is odd or -9 is not negative
c) 4 is even and -9 is negative
d) 4 is odd and -9 is not negative
De-Morgan’s
Laws
• Which of the following statements is the negation of the statements
“4 is odd or -9 is positive”?
a) 4 is even or -9 is not negative
b) 4 is odd or -9 is not negative
c) 4 is even and -9 is negative
d) 4 is odd and -9 is not negative
View Answer
• Answer: c
Explanation: Using De Morgan’s Law ~(A V B) ↔ ~A ∧~B
De-Morgan’s
Laws

Which of the following represents: ~A (negation of A) if A stands for “I
like badminton but hate maths”?
a) I hate badminton and maths
b) I do not like badminton or maths
c) I dislike badminton but love maths
d) I hate badminton or like maths
De-Morgan’s
Laws
• Which of the following represents: ~A (negation of A) if A stands for “I
like badminton but hate maths”?
a) I hate badminton and maths
b) I do not like badminton or maths
c) I dislike badminton but love maths
d) I hate badminton or like maths
View Answer
• Answer: d
Explanation: De Morgan’s Law ~ (A ∧B) ↔ ~A V ~B
De-Morgan’s
Laws
The compound statement A v ~(A ∧B).

a) True
b) False
De-Morgan’s
Laws
• The compound statement A v ~(A ∧B).
a) True
b) False
View Answer
• Answer: a
Explanation: Applying De-Morgan’s law we get A v ~ A Ξ Tautology
De-Morgan’s
Laws

Which of the following is De-Morgan’s law?
a) P ∧(Q v R) Ξ (P ∧Q) v (P ∧R)
b) ~(P ∧R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧~R
c) P v ~P Ξ True, P ∧~P Ξ False
d) None of the mentioned
De-Morgan’s
Laws
• Which of the following is De-Morgan’s law?
a) P ∧(Q v R) Ξ (P ∧Q) v (P ∧R)
b) ~(P ∧R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧~R
c) P v ~P Ξ True, P ∧~P Ξ False
d) None of the mentioned
View Answer
• Answer: b
Explanation: Definition of De–Morgan’s Law.
De-Morgan’s
Laws
What is the dual of (A ∧B) v (C ∧D)?

a) (A V B) v (C v D)
b) (A V B) ^ (C v D)
c) (A V B) v (C ∧D)
d) (A ∧B) v (C v D)
De-Morgan’s
Laws
• What is the dual of (A ∧B) v (C ∧D)?
a) (A V B) v (C v D)
b) (A V B) ^ (C v D)
c) (A V B) v (C ∧D)
d) (A ∧B) v (C v D)
View Answer
• Answer: b
Explanation: In dual ∧is replaced by v and vice – versa
De-Morgan’s
Laws

~ A v ~ B is logically equivalent to?
a) ~ A → ~ B
b) ~ A ∧~ B
c) A → ~B
d) B V A
De-Morgan’s
Laws
• ~ A v ~ B is logically equivalent to?
a) ~ A → ~ B
b) ~ A ∧~ B
c) A → ~B
d) B V A
View Answer
• Answer: c
Explanation: By identity A → B Ξ ~A V B.
De-Morgan’s
Laws
Negation of statement (A ∧B) → (B ∧C) is _____________

a) (A ∧B) →(~B ∧~C)
b) ~(A ∧B) v ( B v C)
c) ~(A →B) →(~B ∧C)
d) None of the mentioned
De-Morgan’s
Laws
• Negation of statement (A ∧B) → (B ∧C) is _____________
a) (A ∧B) →(~B ∧~C)
b) ~(A ∧B) v ( B v C)
c) ~(A →B) →(~B ∧C)
d) None of the mentioned
View Answer
• Answer: a
Explanation: ~(A →B) Ξ A ∧~B using this we can easily fetch the
answer
De-Morgan’s
Laws

Which of the following satisfies commutative law?
a) ∧
b) v
c) ↔
d) All of the mentioned
De-Morgan’s
Laws
• Which of the following satisfies commutative law?
a) ∧
b) v
c) ↔
d) All of the mentioned
View Answer
• Answer: d
Explanation: All of them satisfies commutative law
De-Morgan’s
Laws
If the truth value of A v B is true, then truth value of ~A ∧B can be

___________
a) True if A is false
b) False if A is false
c) False if B is true and A is false
d) None of the mentioned
De-Morgan’s
Laws
• If the truth value of A v B is true, then truth value of ~A ∧B can be
___________
a) True if A is false
b) False if A is false
c) False if B is true and A is false
d) None of the mentioned
View Answer
• Answer: a
Explanation: If A is false then both the condition are obeyed
De-Morgan’s
Laws

If P is always against the testimony of Q, then the compound
statement P→(P v ~Q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
De-Morgan’s
Laws
• If P is always against the testimony of Q, then the compound
statement P→(P v ~Q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
View Answer
• Answer: a
Explanation: Since either hypothesis is false or both (hypothesis as
well as conclusion) are true
Tautologies and
Contradictions

A compound proposition that is always ___________ is called a
tautology.
a) True
b) False
Tautologies and
Contradictions
• A compound proposition that is always ___________ is called a
tautology.
a) True
b) False
View Answer
• Answer: a
Explanation: Tautology is always true.
Tautologies and
Contradictions

A compound proposition that is always ___________ is called a
contradiction.
a) True
b) False
Tautologies and
Contradictions
• A compound proposition that is always ___________ is called a
contradiction.
a) True
b) False
View Answer
• Answer: b
Explanation: Contradiction is always false
Tautologies and
Contradictions

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
Tautologies and
Contradictions
• 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
Tautologies and
Contradictions

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
Tautologies and
Contradictions
• 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
Tautologies and
Contradictions

A compound proposition that is neither a tautology nor a
contradiction is called a ___________
a) Contingency
b) Equivalence
c) Condition
d) Inference
Tautologies and
Contradictions
• 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
Tautologies and
Contradictions
• ∨ ∧ ∧
¬ (A q) (A q) is a ___________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Tautologies and
Contradictions
• ∨ ∧ ∧
¬ (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.
Tautologies and
Contradictions
• ∨ ∨ ∨
(A ¬A) (q T) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Tautologies and
Contradictions
• ∨ ∨ ∨
(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
Tautologies and
Contradictions
• ∧ ∨ ∧
A ¬(A (A T)) is always __________
a) True
b) False
Tautologies and
Contradictions
• ∧ ∨ ∧
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
Tautologies and
Contradictions
• ∨ ∨ ∨
(A F) (A T) is always _________
a) True
b) False
Tautologies and
Contradictions
• ∨ ∨ ∨
(A F) (A T) is always _________
a) True
b) False
View Answer
• Answer: a
Explanation: ≡ (A ∨F) ∨(A ∨T)
≡ A ∨T ≡ T
Tautologies and
Contradictions
• ∨
A → (A q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Tautologies and
Contradictions
• ∨
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

You might also like