Propositional Logic – WFF, truth tables, logic gates, adder circuits Quiz - ICSE Class 11 Computer Science

Free practice quiz: Propositional Logic – WFF, truth tables, logic gates, adder circuits (ICSE Class 11 Computer Science). 62 multiple-choice questions with answers and explanations. Play online, no sign-up needed.

This ICSE Class 11 Computer Science practice quiz has 62 multiple-choice questions on Propositional Logic – WFF, truth tables, logic gates, adder circuits, and 62 of them come with an explanation. Try the 5 sample questions below (tap an option to check yourself), then play the full quiz online. No sign-up needed.

Sample questions

1. Which of the following is NOT a well-formed formula (WFF) in propositional logic?

   1. (P ∧ Q)
   2. ¬(P ∨ ¬Q)
   3. P → Q ↔ R
   4. P ∧ ¬ ∨ Q
   Show answer

   Answer: D. P ∧ ¬ ∨ Q

   A WFF must have balanced parentheses and operators applied to propositional variables or other WFFs. 'P ∧ ¬ ∨ Q' has an operator '¬' applied to nothing, and an operator '∨' with missing operands, making it ill-formed.

2. Consider the propositional formula (P ∨ ¬Q) ∧ R. If P is True, Q is True, and R is False, what is the truth value of the formula?

   1. True
   2. False
   3. Neither True nor False
   4. Depends on operator precedence
   Show answer

   Answer: B. False

   First, evaluate ¬Q. Since Q is True, ¬Q is False. Then, evaluate (P ∨ ¬Q): True ∨ False is True. Finally, evaluate True ∧ R. Since R is False, True ∧ False is False.

3. What is the result of XORing two identical bits (e.g., 0 XOR 0 or 1 XOR 1)?

   1. 0
   2. 1
   3. Undefined
   4. Depends on the system
   Show answer

   Answer: A. 0

   The XOR (exclusive OR) operation outputs 1 only when the inputs are different. When the inputs are the same (0 XOR 0 or 1 XOR 1), the output is 0.

4. Consider a 2-bit adder circuit. What are the maximum number of bits required to represent the sum of two 2-bit numbers?

   1. 2 bits
   2. 3 bits
   3. 4 bits
   4. 5 bits
   Show answer

   Answer: B. 3 bits

   The largest 2-bit number is 3 (binary 11). The sum of two such numbers is 3 + 3 = 6. In binary, 6 is represented as 110, which requires 3 bits. The maximum sum of two n-bit numbers is 2 * (2^n - 1). For n=2, this is 2 * (2^2 - 1) = 2 * 3 = 6. 6 in binary is 110, requiring 3 bits. The carry-out from the most significant bit might need an extra bit.

5. What is the primary purpose of using truth tables in propositional logic?

   1. To define new logical connectives.
   2. To determine the validity of logical arguments and the truth value of complex formulas.
   3. To simplify complex boolean expressions.
   4. To represent the physical layout of logic gates.
   Show answer

   Answer: B. To determine the validity of logical arguments and the truth value of complex formulas.

   Truth tables systematically list all possible truth value combinations for the variables in a formula and show the resulting truth value of the formula, thus helping to analyze its properties.

More questions in this quiz

Answers and explanations are in the full quiz.

1. Consider the propositional formula (P ∨ Q) → R. If P is True, Q is False, and R is True, what is the truth value of the formula?
2. A half-adder circuit can add two binary bits. What are the outputs of a half-adder for the inputs A=1 and B=0?
3. Which logic gate implements the operation of logical disjunction (OR)?
4. Consider the propositional formula (P ∧ Q) → (R ∨ S). If P is False, Q is True, R is False, and S is True, what is the truth value of the formula?
5. What is the Boolean expression for the output of a full-adder's 'Sum' bit when the inputs are A, B, and Cin (Carry-in)?
6. Which of the following is a tautology?
7. What does the NAND gate produce when both of its inputs are 1?
8. Consider the propositional formula P ↔ Q. Which of the following pairs of truth values for P and Q would make this formula False?
9. What is the primary function of a NOR gate?
10. Which logical operator is represented by the symbol '→'?
11. A full-adder circuit is used to add three binary bits. If the inputs are A=1, B=1, and Cin=1, what are the outputs for Sum and Cout (Carry-out)?
12. Which of the following is NOT equivalent to P?
13. A XOR gate produces an output of 1 when:
14. Which of the following is a well-formed formula (WFF) and a contradiction?
15. Consider the propositional formula (P ∨ Q) ∧ (¬P ∨ R). If P is True, Q is False, and R is True, what is the truth value of the formula?
16. What is the output of a NOT gate with input 1?
17. In propositional logic, the statement 'P implies Q' can be expressed equivalently as:
18. Which of the following is a well-formed formula (WFF) in propositional logic?
19. What is the Boolean expression for the Carry-out bit of a full-adder circuit with inputs A, B, and Cin?
20. Consider the propositional formula (P ↔ Q). What are the truth values of P and Q for which this formula is True?
21. The symbol '∨' in propositional logic represents which logical operation?
22. Which of the following is NOT a primitive logical connective in standard propositional logic?
23. Consider the propositional formula (P ∧ Q) ∨ (¬P ∧ R). If P is False, Q is True, and R is True, what is the truth value of the formula?
24. In a half-adder, if the inputs are A=1 and B=1, what are the outputs for Sum and Carry?
25. Which of the following propositional formulas is equivalent to (P ∨ Q) ∧ R?
26. The 'carry out' signal from a full adder is generated when:
27. Which logic gate has the truth table where the output is 1 if and only if the inputs are different?
28. Consider the propositional formula (P ∨ Q) → ¬R. If P is False, Q is True, and R is False, what is the truth value of the formula?
29. What logical operation is performed by a circuit with the following truth table? | A | B | Output | |---|---|--------| | 0 | 0 | 1 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 0 |
30. Consider the propositional formula (P → Q) ∧ (Q → R). If P is True, Q is False, and R is True, what is the truth value of the formula?
31. Which of the following is a valid well-formed formula (WFF)?
32. What is the primary function of an AND gate?
33. If a propositional formula is a tautology, its truth value is:
34. Which of the following logical equivalences is correct?
35. Which logical connective is symbolized by '↔'?
36. What is the output of a NOR gate if its inputs are 0 and 1?
37. Consider the propositional formula (P ∧ Q) ↔ (R ∨ S). If P=True, Q=False, R=True, and S=False, what is the truth value of the formula?
38. Which of the following is a contradiction?
39. In a full adder, the 'Sum' output can be expressed as the XOR of the three inputs. If A=1, B=0, and Cin=1, what is the Sum?
40. What does the logical connective '∧' represent?
41. Consider the propositional formula (P ∨ ¬Q) ∧ (R → S). If P is True, Q is True, R is False, and S is True, what is the truth value of the formula?
42. Which logic gate is equivalent to a NAND gate followed by a NOT gate?
43. What is the definition of a well-formed formula (WFF) in propositional logic?
44. Consider the propositional formula (P ∧ ¬Q) → R. If P is True, Q is False, and R is False, what is the truth value of the formula?
45. Which logical gate produces an output of 0 if and only if both inputs are 1?
46. If a propositional formula is a contingency, it means that:
47. Consider a 4-bit ripple-carry adder. What is the maximum number of full-adder modules required for its construction?
48. Which of the following is logically equivalent to ¬(P ∧ Q)?
49. A half-subtractor circuit is used to subtract two bits. What are the outputs for Difference and Borrow for inputs A=0 and B=1?
50. The proposition 'P XOR Q' is true if:
51. Which of the following is a correct way to represent the negation of P?
52. Consider the truth table for the implication P → Q. When is the statement P → Q False?
53. What is the circuit symbol for a NOT gate?
54. Consider the propositional formula (P ∨ Q) ∧ ¬(P ∧ Q). This formula is equivalent to:
55. Which of the following is NOT a primitive logical connective in Boolean algebra?
56. In a full adder, the Carry-out signal is generated by which logical operation on the inputs A, B, and Cin?
57. Consider the propositional formula (P ∨ Q) ↔ (P ∧ Q). When is this formula False?

More quizzes

• Software – System vs application software, OS overview▶ Play
• Computer Hardware – System architecture, processor, memory types▶ Play
• Elementary Data Structures – stacks, queues, dequeue▶ Play
• Numbers – Number systems, base conversion, arithmetic in bases▶ Play
• Packages – user-defined packages, imports, interaction▶ Play

Browse all Computer Science quizzes

More to play