Skip to main content
A-LevelComputer ScienceHardware9618/32 · Oct/Nov 2023 · Q75 Marks

This logic circuit represents the Boolean expression: X = A + B + C [Figure X.X]

  1. (a)Complete this truth table for the given logic circuit. [Figure X.X][1]
  2. (b)Apply De Morgan's laws to the expression: X = A + B + C X =[1]
  3. (c)Simplify the following expression using Boolean algebra. Show all the stages in your simplification. T = Χ.Υ.Ζ + Χ.Y.Z + X[3]

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 2023). The mark or mark type is shown in brackets.

  1. [1] A B C X 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0
  2. [1] X= A.B.C
  3. [1] (T=) Χ.Z.(Y + Y) + X (Distributive law)
  4. [1] (T=) Χ.Z.(1) + X (Complement law)
  5. [1] (T=) Χ.Z + X (Identity law)
  6. [1] (T=) Χ + Z (Redundancy law (to get final answer))

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
Hardware, A-Level Computer Science (syllabus 9618). Structured question, 5 marks.
Source
A-Level Computer Science, Oct/Nov 2023 Paper 3 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