Boolean logic: past paper questions
Real questions on boolean logic
The newest 17 of 17 written questions. Open one to see it on the real paper.
- 0984/21 · May/June 2026 · Q8a[3]
Write the logic expression for the given logic circuit.
See it on the paper → - 0984/21 · May/June 2026 · Q8b[4]
0 0 0 1 1 1 1 (b) Complete the truth table for the given logic circuit. A B c working space X 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1
See it on the paper → - 0984/22 · May/June 2026 · Q8a[5]
Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. Do not simplify the logic expression. A—— B— 4 Cc —
See it on the paper → - 0984/22 · May/June 2026 · Q8b[4]
0 0 0 1 1 1 1 (b) Complete the truth table from the given logic expression. A B Cc working space Z 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1
See it on the paper → - 0984/22 · October/November 2025 · Q6a[4]
Draw a logic circuit for the logic expression. Each logic gate must have a maximum of two inputs. Do not simplify the logic expression. J K X L
See it on the paper → - 0984/22 · October/November 2025 · Q6b[4]
Complete the truth table for the given logic expression. J K L 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Working space X
See it on the paper → - 0984/21 · May/June 2025 · Q7a[4]
Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. A B X C Do not simplify the logic expression.
See it on the paper → - 0984/21 · May/June 2025 · Q7b[4]
Complete the truth table for the given logic expression. A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Working space X
See it on the paper → - 0984/22 · May/June 2025 · Q8a[2]
Draw the symbol for an XOR logic gate and complete the truth table for it. XOR logic gate symbol: Truth table: A B 0 0 0 1 1 0 1 1 X
See it on the paper → - 0984/22 · May/June 2025 · Q8b(i)[2]
Write the logic expression for the crane moving. X =
See it on the paper → - 0984/22 · May/June 2025 · Q8b(ii)[4]
Complete the truth table for the crane moving. A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Working space X
See it on the paper → - 0984/22 · October/November 2024 · Q9a[4]
Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. P Q X R Do not simplify the logic expression.
See it on the paper → - 0984/21 · May/June 2024 · Q8a[5]
Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. Do not simplify this logic expression. R S Z T
See it on the paper → - 0984/22 · May/June 2024 · Q8a[3]
Write the logic expression for this problem.
See it on the paper → - 0984/21 · May/June 2023 · Q9a[4]
Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. Do not simplify this logic expression. A B Z C
See it on the paper → - 0984/12 · May/June 2022 · Q5a[5]
Draw a logic circuit to represent the given logic statement. Do not attempt to simplify the logic statement. All logic gates must have a maximum of two inputs. A B X C
See it on the paper → - 0984/12 · October/November 2020 · Q4a[4]
Draw a logic circuit to match the given logic statement. All logic gates must have a maximum of two inputs. Do not attempt to simplify the logic statement. A B X C
See it on the paper →
What examiners said
This question was answered well by most of the candidates. Use of the original logic expression is recommended to answer this question.
— Examiner report, May/June 2025, 0984/21 Q7(b) (Cambridge)
Most candidates drew the correct XOR logic gate symbol, as shown on the syllabus, with two inputs and one output, and then correctly completed its truth table for it.
— Examiner report, May/June 2025, 0984/22 Q8(a) (Cambridge)
Most candidates gave a partially correct logic expression to represent the crane moving, as described in the question.
— Examiner report, May/June 2025, 0984/22 Q8(b)(i) (Cambridge)
Past papers, syllabus and examiner reports © UCLES (Cambridge University Press & Assessment). Questions are matched to topics from the official syllabus. AssessPro is independent and not endorsed by Cambridge.