Skip to main content
O-LevelComputer ScienceBoolean logic2210/11 · May/June 2020 · Q29 Marks

Consider the logic statement: X = (((A NAND B) OR (B XOR C)) AND NOT C)

  1. (a)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.[5]
  2. (b)Complete the truth table to represent the given logic statement. A B C Working space X 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 [4]

This question uses a diagram from the original paper, which isn't shown here. Open the full paper from the past papers archive to see it.

Mark scheme

Marking points from the official mark scheme (May/June 2020). The mark or mark type is shown in brackets.

  1. [5] 2(a) (Diagram showing gates: NAND for A,B; XOR for B,C; OR for NAND and XOR outputs; NOT for C; AND for OR and NOT outputs, leading to X) 1 mark for each correct gate.
  2. [4] 2(b) (Truth table with X column: 1, 0, 1, 0, 1, 0, 1, 0) 4 marks for 8 correct outputs; 3 marks for 6 or 7 correct outputs; 2 marks for 4 or 5 correct outputs; 1 mark for 2 or 3 correct outputs.

Write your answer and get it marked

On Oracle Prep you can write or photograph your own answer and have it marked by AI against this mark scheme, with feedback on what you missed.

Sign up free →

About this question

Topic
Boolean logic, O-Level Computer Science (syllabus 2210). Structured question, 9 marks.
Source
O-Level Computer Science, May/June 2020 Paper 1 Variant 1, question 2.

Questions and mark schemes are from past examination papers and remain the copyright of the exam board. How Oracle Prep builds its content

Related Computer Science questions

© 2026 Oracle Prep