6(a)(i)Boolean Algebra Logic CircuitsMedium2 marks
The Karnaugh map (K-map) represents a logic circuit with four inputs.
Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.
PenEraserUndoRedoClear
May/June 2026 Paper 33
0/75 marks
0Correct0Partial0Wrong26Unattempted
Filters0 active
6(a)(ii)Boolean Algebra Logic CircuitsMedium2 marks
Write the Boolean expression from your answer to 6(a)(i) as a simplified sum-of-products. Do not carry out any further simplification.
Simplified sum-of-products (use AND, OR, NOT, e.g. A AND B OR NOT C)
6(a)(iii)Boolean Algebra Logic CircuitsMedium1 mark
Write the Boolean expression from your answer to 6(a)(ii) in its simplest form by using Boolean algebra to simplify it.
Simplest form (use AND, OR, NOT, e.g. A AND (B OR NOT C))
6(b)Boolean Algebra Logic CircuitsHard3 marks
Simplify the following expression using De Morgan’s laws and Boolean algebra. Show all the stages in your simplification.
Working (name the law used at each stage)
0 words
Simplest form (use AND, OR, NOT, e.g. NOT A AND NOT B)