THAKUR COLLEGE OF SCIENCE AND COMMERCE
Chapter: LOGIC
1. Statement and its truth value, Logical connective, compound
statements.
1. Which of the following is a valid statement in logic? A) Open the window. B) 2 + 2 = 4 C)
What is your name? D) Please sit down.
2. The truth value of the statement '5 × 2 = 11' is: A) True B) False C) Cannot be determined
D) Depends on context
3. The conjunction 'p ∧ q' is true when: A) p is true and q is true B) p is false and q is true C) p
is true and q is false D) Both p and q are false
4. Which connective represents 'if and only if'? A) → B) ↔ C) ∧ D) ∨
5. The negation of a true statement is: A) True B) False C) Undefined D) Same as original
6. A statement that cannot be broken into simpler statements is called: A) Compound statement
B) Simple statement C) Complex statement D) Conditional statement
7. The truth table for 'p ∨ q' has value F only when: A) p = T, q = T B) p = F, q = F C) p = F, q =
T D) p = T, q = F
8. Which of the following is an example of a compound statement? A) 3 is a prime number B) 3
is prime and 4 is even C) All natural numbers are integers D) Open the door
9. The symbol '~p' represents: A) Negation of p B) Conjunction of p C) Disjunction of p D)
Implication of p
10. If p is false and q is true, the truth value of 'p → q' is: A) True B) False C) Cannot be
determined D) False only when both are false
2. Truth tables, negation of statements and compound
statements, Statement pattern, logical equivalence.
11. Two statements are logically equivalent if: A) They have the same truth table B) They are
both tautologies C) They are both contradictions D) They have different truth tables
12. Negation of (p ∧ q) is equivalent to: A) ~p ∨ ~q B) ~p ∧ ~q C) p ∨ q D) ~p → ~q
13. Negation of (p ∨ q) is equivalent to: A) ~p ∧ ~q B) ~p ∨ ~q C) p ∧ q D) p → q
14. Which of the following is a tautology? A) p ∨ ~p B) p ∧ ~p C) p → q D) ~p ∧ q
15. Which of the following is a contradiction? A) p ∨ ~p B) p ∧ ~p C) p → q D) p ↔ p
16. The statement p ↔ q is true when: A) p and q have same truth values B) p is true and q is
false C) p is false and q is true D) p and q have opposite truth values
17. Logical equivalence between p → q and ~p ∨ q is called: A) Conditional law B) De Morgan's
law C) Idempotent law D) Absorption law
18. The truth table of (~p ∨ q) ↔ ~(p ∧ q) shows: A) They are equivalent B) They are
contradictions C) They are tautologies D) They are contingencies
19. Which law states that ~(p ∨ q) ≡ ~p ∧ ~q? A) De Morgan's law B) Absorption law C)
Distributive law D) Idempotent law
20. A contingency is a statement pattern that: A) Is always true B) Is always false C) Is
sometimes true, sometimes false D) Is logically equivalent to a tautology
3. Tautology, contradiction and contingency.
21. p ∨ ~p is an example of: A) Tautology B) Contradiction C) Contingency D) None
22. p ∧ ~p is an example of: A) Tautology B) Contradiction C) Contingency D) Logical
equivalence
23. A statement pattern that is always true is called: A) Tautology B) Contradiction C)
Contingency D) Inverse
24. A statement pattern that is always false is called: A) Contradiction B) Tautology C)
Contingency D) Biconditional
25. A statement pattern that is neither tautology nor contradiction is called: A) Contingency B)
Tautology C) Contradiction D) Inverse
26. Which of these has all truth values as 'F' in its truth table? A) p ∧ ~p B) p ∨ ~p C) ~p ∧ q
D) p → q
27. Which of these has all truth values as 'T' in its truth table? A) p ∨ ~p B) p ∧ ~p C) p ↔ ~p
D) ~p ∧ q
28. If a statement is always true regardless of values of its variables, it is: A) Tautology B)
Contradiction C) Contingency D) Negation
29. Which is true for a contradiction? A) Always false B) Sometimes true C) Always true D)
True when p is false
30. If p is true, then p ∨ ~p is: A) True B) False C) Cannot be determined D) Opposite of p
4. Quantifiers and quantified statements, Duality.
31. The symbol '∀' denotes: A) Universal quantifier B) Existential quantifier C) Negation D)
Conjunction
32. The symbol '∃' denotes: A) Existential quantifier B) Universal quantifier C) Negation D)
Biconditional
33. Negation of 'All students are present' is: A) Some students are not present B) No student is
present C) Some students are present D) All students are absent
34. Negation of 'Some numbers are prime' is: A) No number is prime B) All numbers are prime
C) Some numbers are not prime D) All numbers are composite
35. The dual of p ∨ q is: A) p ∧ q B) q ∨ p C) ~p ∨ q D) p ∨ ~q
36. If a statement is obtained by interchanging ∨ with ∧ and t with c, it is called: A) Dual B)
Inverse C) Converse D) Contrapositive
37. The dual of t ∨ p is: A) c ∧ p B) t ∧ p C) p ∨ c D) c ∨ p
38. Negation of 'p → q' is equivalent to: A) p ∧ ~q B) ~p ∨ q C) ~p ∧ q D) p ∨ q
39. Negation of 'p ↔ q' is equivalent to: A) (p ∧ ~q) ∨ (q ∧ ~p) B) ~p ∧ ~q C) p ∧ q D) ~p ∨ ~q
40. Negation of 'p ∧ q' is equivalent to: A) ~p ∨ ~q B) ~p ∧ ~q C) p ∨ q D) ~p → q
5. Application of logic to switching circuits, switching table.
41. In switching circuits, '1' in the table represents: A) Switch ON B) Switch OFF C) Lamp off
D) No current
42. In switching circuits, '0' in the table represents: A) Switch OFF B) Switch ON C) Lamp on
D) Current flows
43. Two switches in series correspond to which logical operation? A) Conjunction (AND) B)
Disjunction (OR) C) Negation D) Biconditional
44. Two switches in parallel correspond to which logical operation? A) Disjunction (OR) B)
Conjunction (AND) C) Negation D) Implication
45. Complementary switches correspond to: A) p and ~p B) p and q C) ~p and ~q D) p ∨ q
46. The input-output table for two switches in series shows '1' when: A) Both are ON B) Both
are OFF C) One is ON D) One is OFF
47. The input-output table for two switches in parallel shows '0' when: A) Both are OFF B) Both
are ON C) One is ON D) One is OFF
48. Switching circuits and logic were related by: A) Claude Shannon B) George Boole C)
Aristotle D) Leibniz
49. A lamp glows only if all switches in series are closed. This is equivalent to: A) Logical AND
B) Logical OR C) Logical NOT D) Logical XOR
50. The symbolic form of two switches in parallel is: A) p ∨ q B) p ∧ q C) ~p ∨ q D) p ↔ q