Skip to main content
O-LevelComputer ScienceBoolean logic2210/12 · May/June 2016 · Q713 Marks

Complete the truth table for this logic circuit. [Diagram of logic circuit]

  1. (a)Complete the truth table for this logic circuit. [Diagram of logic circuit][4]
  2. (b)Draw a logic circuit corresponding to the following logic statement: X = 1 if ((A is 1 OR B is 1 ) AND ( A is 1 AND B is 1 ) ) OR (C is NOT 1)[5]
  3. (c)Re-draw the following logic circuit using NAND gates only. [Diagram of logic circuit] Logic circuit re-drawn:[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 2016). The mark or mark type is shown in brackets.

  1. [4] 7 (a) 4 marks for 8 correct X bits 3 marks for 6 correct X bits 2 marks for 4 correct X bits 1 mark for 2 correct X bits A B C X 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 0
  2. [5] (b) 1 mark for each correct gate with correct source of input [Diagram of logic circuit]
  3. [4] (c) Each dotted area is 1 mark [Diagram of logic circuit using NAND gates]

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, 13 marks.
Source
O-Level Computer Science, May/June 2016 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