Skip to main content
O-LevelComputer ScienceBoolean logic2210/12 · May/June 2018 · Q710 Marks

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

  1. (a)Draw a logic circuit to represent the given logic statement.[6]
  2. (b)Complete the truth table for 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 2018). The mark or mark type is shown in brackets.

  1. [1] (a) NOT gate with input B
  2. [1] (a) AND gate with inputs A and output of NOT B
  3. [1] (a) NAND gate with inputs (output of A AND NOT B) and C
  4. [1] (a) AND gate with inputs A and C
  5. [1] (a) OR gate with inputs (output of A AND C) and B
  6. [1] (a) XOR gate with inputs (output of NAND) and (output of OR)
  7. [4] (b) 8 correct outputs for X (1, 1, 0, 0, 1, 1, 0, 0)
  8. [3] (b) 6 or 7 correct outputs for X
  9. [2] (b) 4 or 5 correct outputs for X
  10. [1] (b) 2 or 3 correct outputs for X

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, 10 marks.
Source
O-Level Computer Science, May/June 2018 Paper 1 Variant 2, question 7.

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