Skip to content
IGCSE Computer Science 0478 · Topic 10

Boolean logic: past paper questions

41 real questionsasked in 7 of the last 10 exam series2019–2026usually: Complete, Draw, State, Write, Identify

Real questions on boolean logic

The newest 20 of 41 written questions. Open one to see it on the real paper.

  1. 0478/21 · May/June 2026 · Q2[4]

    Identify four operators that are not arithmetic operators from the list. / > <= + * ^ AND DIV MOD NOT

    See it on the paper →
  2. 0478/21 · May/June 2026 · Q8a[3]

    Write the logic expression for the given logic circuit.

    See it on the paper →
  3. 0478/21 · May/June 2026 · Q8b[4]

    Complete the truth table for the given logic circuit. 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 →
  4. 0478/23 · May/June 2026 · Q7a[4]

    Draw a logic circuit for the given logic expression. Each logic gate must have a maximum of two inputs. Do not simplify this logic expression. P Q X R

    See it on the paper →
  5. 0478/23 · May/June 2026 · Q7b[4]

    Complete the truth table from the given logic expression. P Q R 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 →
  6. 0478/22 · February/March 2026 · Q7a[4]

    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 X C

    See it on the paper →
  7. 0478/22 · February/March 2026 · Q7b[4]

    Complete the truth table from 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 →
  8. 0478/23 · October/November 2025 · Q4c(i)[2]

    Write the logic expression for this problem. X =

    See it on the paper →
  9. 0478/23 · October/November 2025 · Q4c(ii)[4]

    Complete the truth table for this problem. 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 (ii)

    See it on the paper →
  10. 0478/22 · May/June 2024 · Q2[4]

    one line to link each logic function to its standard symbol. Not all standard symbols will be used.

    See it on the paper →
  11. 0478/22 · May/June 2024 · Q5[6]

    how each type of operator is used. Give an example statement, in pseudocode, for each one.

    See it on the paper →
  12. 0478/22 · May/June 2024 · Q8a[3]

    the logic expression for this problem.

    See it on the paper →
  13. 0478/22 · May/June 2024 · Q8b[4]

    the truth table for this problem.

    See it on the paper →
  14. 0478/22 · February/March 2024 · Q7a[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 X C

    See it on the paper →
  15. 0478/22 · February/March 2024 · Q7b[4]

    Complete the truth table from the given logic expression. Working space 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 X

    See it on the paper →
  16. 0478/23 · October/November 2023 · Q6a[2]

    The only time the output is 1 is when both inputs are 1. Logic gate Complete the truth table for this description. A B 0 0 0 1 1 0 1 1 X

    See it on the paper →
  17. 0478/23 · October/November 2023 · Q6b[2]

    The output is 1 when both inputs are different. Logic gate Complete the truth table for this description. A B 0 0 0 1 1 0 1 1 X

    See it on the paper →
  18. 0478/23 · October/November 2023 · Q6c[2]

    The only time the output is 1 is when both inputs are 0. Logic gate Complete the truth table for this description. A B 0 0 0 1 1 0 1 1 X

    See it on the paper →
  19. 0478/23 · October/November 2023 · Q6d[5]

    Consider this logic expression: X = (NOT A OR NOT B) OR NOT C Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. Do not attempt to simplify this logic expression. A B X C

    See it on the paper →
  20. 0478/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.

    See it on the paper →

What examiners said

Comprehensive responses • Most candidates drew good diagrams of logic circuits to represent the given logic expression. Limited responses • Some candidates need to take more care when drawing logic gates to make sure each gate has its own distinctive shape, for example, NOR and XOR gates shouldn’t have straight sides with curved backs, as this could confuse them with NOT gates.

— Examiner report, February/March 2026, 0478/22 Q7(a) (Cambridge)

Comprehensive responses • Most candidates completed their truth table to accurately match the given logic expression. Limited responses • A small number of candidates gave a response that was the exact opposite to the expected answer suggesting either an extra NOT had been applied or a NOT had been missed.

— Examiner report, February/March 2026, 0478/22 Q7(b) (Cambridge)

This was answered well by most candidates. They correctly drew the correct logic gate symbols and in the correct order.

— Examiner report, October/November 2023, 0478/23 Q6(d) (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.

Boolean logic — IGCSE Computer Science 0478 past paper questions | AssessPro