Skip to main content
O-LevelComputer ScienceBoolean logic2210/12 · Oct/Nov 2021 · Q1111 Marks

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

  1. (a)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 C[5]
  2. (b)Complete the truth table for the given logic statement. 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[4]
  3. (c)Identify two logic gates that are not included in the given logic statement. Logic gate 1 Logic gate 2[2]

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 (Oct/Nov 2021). The mark or mark type is shown in brackets.

  1. 11(a) One mark per each correct logic gate with correct input(s)
  2. 11(b) 4 marks for 8 correct outputs; 3 marks for 6/7 correct outputs; 2 marks for 4/5 correct outputs; 1 mark for 2/3 correct outputs Outputs for X: 1, 1, 1, 1, 1, 1, 0, 0
  3. 11(c) - NOR; - XOR / EOR

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, 11 marks.
Source
O-Level Computer Science, Oct/Nov 2021 Paper 1 Variant 2, question 11.

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