Skip to main content
O-LevelComputer ScienceBoolean logic2210/11 · May/June 2021 · Q610 Marks

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

  1. (a)Draw a logic circuit to represent the given logic statement. Do not attempt to simplify the statement. All logic gates must have a maximum of two inputs. [Figure 6.1][6]
  2. (b)Consider the completed truth table for the given logic statement. Row A B C Working space X number 1 0 0 0 0 2 0 0 1 1 3 0 1 0 0 4 0 1 1 1 5 1 0 0 0 6 1 0 1 1 7 1 1 0 0 8 1 1 1 1 There are four errors in the truth table in the output (X) column. Identify the four incorrect outputs. Write the row number to identify each incorrect output. Row ... Row ... Row ... Row ...[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 2021). The mark or mark type is shown in brackets.

  1. [6] (a) One mark per each correct logic gate, with correct input: [Diagram of logic circuit]
  2. [4] (b) Row 1 Row 3 Row 4 Row 5

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 2021 Paper 1 Variant 1, question 6.

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