Discrete Mathematics
(Unit-1: Propositional Logic)
Prepared by: Dr. Boina Anil Kumar
Practice Questions
Set-1
Topic: Proposition
Q1: Convert the given English sentences into propositions.
Let P and Q be the propositions defined as follows:
P : You play cricket
Q: You miss the film
(a) If you play the cricket, then you miss the film.
(b) If you do not play cricket, then you do not miss the film.
(c) You either paly cricket or miss the film, but you play cricket if you miss the
film.
(d) Playing cricket is necessary for you to miss the film.
(e) Playing cricket is sufficient for you to miss the film.
Q2: Convert the given English sentences into propositions.
Let P , Q and R be the propositions defined as follows:
P : You go to school
Q: You appear in the exam
R: You pass the exam
(a) You do not go to school and you do not appear in the exam.
(b) If you appear in the exam, then you pass the exam.
(c) You go to school, but you do not pass the exam.
(d) If you do not go to the school and do not appear in the exam, then you do
not pass the exam.
(e) Either you go to school or you pass the exam.
(f) You go to school and you appear in the exam, but you do not pass the exam.
Q3: Convert the following propositions into English sentences.
Let P and Q be the propositions defined as follows:
P : I am a computer science graduate
Q: I have a distinction in programming
(a) P ∨ Q
(b) P ∨ ¬Q
(c) ¬P ∨ Q
(d) ¬P ∨ ¬Q
Q4: Convert the following propositions into English sentences.
Let P and Q be the propositions defined as follows:
P : Rakesh is working with TCS
Q: Rakesh is a computer programmer
R: Rakesh is a M. Tech in computer science
(a) P → R
(b) (P ∧ Q) → R
(c) ¬P → ¬Q
(d) (Q ∨ R) → P
(e) P → (Q ∨ R)
(f) ¬P → ¬(Q ∨ R)
(g) P → (Q → R)
(h) Q → (P ↔ R)
Page 2
Discrete Mathematics
(Unit-1: Propositional Logic)
Prepared by: Dr. Boina Anil Kumar
Practice Questions
Set-2
Topic: Composite Propositions
Construct the truth tables for the following composite propositions and determine whether
each proposition is a tautology, contradiction, or contingency.
1. (P V Q) → P
2. ((P ∨ Q) ∨ ¬P ) → Q
3. ¬((P ∧ Q) → P )
4. (P ∧ Q) → P
5. P → (P ∨ Q)
6. P → (P ∧ Q)
7. ((P ∨ Q) ∨ ¬P ) → Q
8. (¬Q ∧ ¬(P ∧ ¬Q)) → ¬P
9. (P ↔ (Q ∧ R)) → (R ∨ ¬P )
10. ((P → Q) ∨ R) ↔ ((P ∨ R) → (Q ∨ R))
11. (¬P ∧ ¬Q) ∧ (P ∨ Q)
12. ¬((P ∧ Q) → P
13. (¬(P → Q) ∨ ¬(Q → R)) ∧ ¬(P → R)
14. (P → Q) ∧ (P ∧ ¬Q)
15. (P ∧ (Q ∧ R)) ↔ ((P ∧ Q) ∧ R)
Page 3
Discrete Mathematics
(Unit-1: Propositional Logic)
Prepared by: Dr. Boina Anil Kumar
Practice Questions
Set-3
Topic: Logical Equivalence
Prove that following are the logical equivalences without using truth tables.
1. ¬(P → Q) ≡ (P ∧ ¬Q)
2. ¬(P ∨ (¬P ∧ Q)) ≡ ¬P ∧ ¬Q
3. P → (Q → R) ≡ (P ∧ Q) → R
4. ¬(P ∨ Q) ∨ (¬P ∧ Q) ≡ ¬P
5. P → (Q → P ) ≡ ¬P → (P → Q)
6. (P ∧ Q) ∨ (¬P ∧ Q) ∨ (P ∧ ¬Q) ≡ P ∨ Q
7. (¬P ∧ (¬Q ∧ R)) ∨ (Q ∧ R) ∨ (P ∧ R) ≡ R
8. ¬(P ∨ (¬P ∧ Q)) ≡ ¬P ∧ ¬Q.
9. Show that (P ∧ Q) → (P ∨ Q) is a tautology
or
Prove that [(P ∧ Q) → (P ∨ Q)] ≡ T
10. Show that (¬P ∧ (P ∨ Q)) → Q is a tautology
or
Prove that [(¬P ∧ (P ∨ Q)) → Q] ≡ T
11. Show that ((P ∨ Q) ∧ ¬(¬P ∧ (¬Q ∨ ¬R))) ∨ (¬P ∧ ¬Q) ∨ (¬P ∧ ¬R) is a tautology
or
Prove that ((P ∨ Q) ∧ ¬(¬P ∧ (¬Q ∨ ¬R))) ∨ (¬P ∧ ¬Q) ∨ (¬P ∧ ¬R) ≡ T
Page 4
