Skip to main content
O-LevelComputer ScienceBoolean logic2210/22 · Oct/Nov 2024 · Q88 Marks

Consider the logic expression: X = (NOT P OR Q) NAND (Q XOR R)

  1. (a)Draw a logic circuit for this logic expression. Each logic gate must have a maximum of two inputs. Do not simplify the logic expression. P Q R [Empty space for drawing] X[4]
  2. (b)Complete the truth table for the given logic expression. P | Q | R | 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 (Oct/Nov 2024). The mark or mark type is shown in brackets.

  1. [1] One mark for each correct gate, with the correct input(s) as shown.
  2. [4] Four marks for eight correct outputs
  3. [3] Three marks for six or seven correct outputs
  4. [2] Two marks for four or five correct outputs
  5. [1] One mark for two or three 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, 8 marks.
Source
O-Level Computer Science, Oct/Nov 2024 Paper 2 Variant 2, question 8.

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