This diagram represents a logic circuit. [Figure with logic circuit diagram showing inputs A, B, C, D and output Z]
- (a)Complete the truth table for the given logic circuit. [Table with columns A, B, C, D, Working space, Z, and rows of binary inputs][3]
- (b)Simplify the given Boolean expression using Boolean algebra. Show your working. Y = A.B.C.D + A.B.C.D + A.B.C.D + A.B.C.D[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.
- [3] One mark for every shaded block of rows for column Z correct (Max 3)
- [2] One mark for correct working from points (Max 2), for example: (Y =) A.B.C.D + A.B.C.D + A.B.C.D + A.B.C.D (Y =) A.D.(B.C + B.C + B.C + B.C) (Y =) A.D.(B.(C + C) + B.(C + C)) (Y =) A.D.(B.(1) + B.(1)) (Y =) A.D.(B + B) (Y =) A.D.(1)
- [1] One mark for correct answer (Y =) A.D
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 →