May/June 2026 Paper 32

2026 · 11 questions · 26 parts · 75 marks

0/75 marks
0Correct0Partial0Wrong26Unattempted
Filters0 active

Questions

Select a part to jump to its question

Finish set
7(a)(i)Boolean Algebra Logic CircuitsMedium2 marks
This truth table represents a logic circuit.
ABCDZ
00000
00011
00100
00110
01001
01011
01101
01111
10000
10011
10100
10110
11001
11011
11101
11111
Complete the Karnaugh map (K-map) for the given truth table.
CDAB = 00AB = 01AB = 11AB = 10
00
01
11
10
7(a)(ii)Boolean Algebra Logic CircuitsMedium2 marks
Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.
Diagram to annotate
PenEraserUndoRedoClear
Draw with the mouse or a finger.
7(a)(iii)Boolean Algebra Logic CircuitsEasy1 mark
Write the Boolean expression from your answer to 7(a)(ii) as a simplified sum-of-products.

Answer

0 words
7(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.

Answer

0 words