May/June 2026 Paper 31

2026 · 11 questions · 28 parts · 75 marks

0/75 marks

0Correct0Partial0Wrong28Unattempted

Filters0 active

Questions

Select a part to jump to its question

1(a)1(b)(i)1(b)(ii)

–/5 mks

–/6 mks

–/6 mks

–/4 mks

–/4 mks

6(a)6(b)6(c)(i)6(c)(ii)

–/9 mks

–/9 mks

8(a)(i)8(a)(ii)8(b)

–/6 mks

–/9 mks

10(a)10(b)10(c)

–/9 mks

11(a)11(b)11(c)

–/8 mks

6(a)Logic Gates Truth TablesMedium3 marks

The diagram shows a logic circuit.

Logic circuit with three inputs A, B and C. A feeds a NOT gate whose output is labelled P; B feeds a second NOT gate whose output is labelled Q. A three-input NAND gate takes P, Q and C and outputs R. An XOR gate takes A and C and outputs S. A three-input AND gate takes R, Q and S and outputs Z.

Complete the truth table for the given logic circuit. Show your working.

A	B	C	P	Q	R	S	Z
0	0	0	Table answer row1_P	Table answer row1_Q	Table answer row1_R	Table answer row1_S	Table answer row1_Z
0	0	1	Table answer row2_P	Table answer row2_Q	Table answer row2_R	Table answer row2_S	Table answer row2_Z
0	1	0	Table answer row3_P	Table answer row3_Q	Table answer row3_R	Table answer row3_S	Table answer row3_Z
0	1	1	Table answer row4_P	Table answer row4_Q	Table answer row4_R	Table answer row4_S	Table answer row4_Z
1	0	0	Table answer row5_P	Table answer row5_Q	Table answer row5_R	Table answer row5_S	Table answer row5_Z
1	0	1	Table answer row6_P	Table answer row6_Q	Table answer row6_R	Table answer row6_S	Table answer row6_Z
1	1	0	Table answer row7_P	Table answer row7_Q	Table answer row7_R	Table answer row7_S	Table answer row7_Z
1	1	1	Table answer row8_P	Table answer row8_Q	Table answer row8_R	Table answer row8_S	Table answer row8_Z

6(b)Boolean Algebra Logic CircuitsEasy1 mark

Describe one benefit of using a Karnaugh map (K-map) for solving logic problems.

Answer

0 words

Context for 6(c)

The Karnaugh map (K-map) represents a logic circuit with four inputs.

	$A B = 00$	$A B = 01$	$A B = 11$	$A B = 10$
$C D = 00$	0	0	1	0
$C D = 01$	0	1	1	0
$C D = 11$	1	1	1	1
$C D = 10$	0	0	1	0

6(c)(i)Boolean Algebra Logic CircuitsMedium3 marks

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Diagram to annotate

Draw with the mouse or a finger.

6(c)(ii)Boolean Algebra Logic CircuitsEasy2 marks

Write the Boolean expression from your answer to 6(c)(i) as a simplified sum-of-products. Do not carry out any further simplification.

Simplified sum-of-products (use for AND, + for OR, e.g. AB + C*D)