Computer Science 9618

Topical Past Papers

Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

May/June 2015.P31/P32

4 (a)(i) Complete the truth table for this logic circuit:

[1]

(ii) Complete the truth table for this logic circuit:

[1]

Page 1 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) A student decides to write an equation for X to represent the full behaviour of each logic circuit.

(i) Write the Boolean expression that will complete the required equation for X for each circuit:

Circuit 1: X = ......................................................................................................................

Circuit 2: X = ...................................................................................................................... [2]

(ii) Write the De Morgan’s Law which is shown by your answers to part (a) and part (b)(i). [1]

(c) Write the Boolean algebraic expression corresponding to the following logic circuit:

[3]

(d) Using De Morgan’s laws and Boolean algebra, simplify your answer to part (c).

Show all your working. [3]

Page 2 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

May/June 2015.P33

5 (a)(i) Complete the truth table for this logic circuit:

[1]

(ii) Complete the truth table for this logic circuit:

[1]

Page 3 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) A student decides to write an equation for X to represent the full behaviour of each logic circuit.

(i) Write the Boolean expression that will complete the required equation for X for each circuit:

Circuit 1: X =

Circuit 2: X = [2]

(ii) Write the De Morgan’s Law which is shown by your answers to part (a) and part (b)(i). [1]

(c) Write the Boolean algebraic expression corresponding to the following logic circuit:

[3]

(d) Using De Morgan’s laws and Boolean algebra, simplify your answer to part (c).

Show all your working. [3]

Oct/Nov 2015.P31/P33

5 (a)(i) Complete the Boolean function that corresponds to the following truth table.

Page 4 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

X = Ᾱ . B . C + [3]

The part to the right of the equals sign is known as the sum-of-products.

(ii) For the truth table above complete the Karnaugh Map (K-map).

[1]

The K-map can be used to simplify the function in part(a)(i).

(iii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products. [2]

(iv) Using your answer to part (a)(iii), write the simplified sum-of-products Boolean function.

X= [2]

(b) The truth table for a logic circuit with four inputs is given below:

Page 5 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(i) Complete the K-map corresponding to the truth table above.

[4]

(ii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products. [2]

(iii) Using your answer to part (b)(ii), write the simplified sum-of-products Boolean function.

X= [2]

Oct/Nov 2015.P32

5 (a)(i) Complete the Boolean function that corresponds to the following truth table.

[1]
Page 6 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

The part to the right of the equals sign is known as the sum-of-products.

(ii) For the truth table above complete the Karnaugh Map (K-map).

[1]

The K-map can be used to simplify the function in part(a)(i).

(iii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products. [2]

(iv) Using your answer to part (a)(iii), write the simplified sum-of-products Boolean function.

Z= [1]

(b) The truth table for a logic circuit with four inputs is given below:

Page 7 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(i) Complete the K-map corresponding to the truth table above.

[4]

(ii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products. [2]

(iii) Using your answer to part (b)(ii), write the simplified sum-of-products Boolean function.

Z= [2]

May/June 2016.P31/P32/P33

5 (a) Complete the truth table for this NAND gate:

[1]

Page 8 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

A SR flip-flop is constructed using two NAND gates.

(b)(i) Complete the truth table for the SR flip-flop.

[4]

(ii) One of the combinations in the truth table should not be allowed to occur.

State the values of S and R that should not be allowed. Justify your choice. [3]

Another type of flip-flop is the JK flip-flop.

(c)(i) Give one extra input present in the JK flip-flop. [1]

(ii) Give one advantage of the JK flip-flop. [1]

(d) Describe the role of flip-flops in a computer. [2]

Page 9 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Oct/Nov 2016.P31/P33

4 (a)(i) Complete the truth table for this logic circuit.

[2]

(ii) State the name given to this logic circuit. [1]

(iii) Name the labels usually given to A and B.

Explain why your answers are more appropriate for the A and B labels. [4]

(b)(i) Write the Boolean expression corresponding to the following logic circuit:

[2]

(ii) Use Boolean algebra to simplify the expression that you gave in part (b)(i).

Show your working. [3]

Page 10 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Oct/Nov 2016.P32

5 (a)(i) A half adder is a logic circuit with the following truth table.

The following logic circuit is constructed.

Complete the following truth table for this logic circuit.

[2]

Page 11 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) State the name given to this logic circuit. [1]

(iii) Name the labels usually given to J and K. [4]

(b)(i) Write down the Boolean expression corresponding to the following logic circuit:

[2]

(ii) Use Boolean algebra to simplify the expression given in part (b)(i).

Show your working. [4]

May/June 2017.P31/P33

3 Consider the following logic circuit, which contains a redundant logic gate.

(a) Write the Boolean algebraic expression corresponding to this logic circuit.

X = [1]

Page 12 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) Complete the truth table for this logic circuit.

[2]

(c)(i) Complete the Karnaugh Map (K-map) for the truth table in part (b).

[1]

The K-map can be used to simplify the expression in part (a).

(ii) Draw loop(s) around appropriate groups to produce an optimal sum-of-products. [2]

(iii) Write a simplified sum-of-products expression, using your answer to part (ii).

X = [2]

(d) One Boolean identity is:

A + ̅A.B = A + B

Page 13 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Simplify the expression for X in part (a) to the expression for X in part (c)(iii). You should use the given
identity. [2]

May/June 2017.P32

3 A logic circuit is shown:

(a) Write the Boolean algebraic expression corresponding to this logic circuit:

S = [4]

(b) Complete the truth table for this logic circuit:

[2]

Page 14 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(c)(i) Complete the Karnaugh Map (K-map) for the truth table in part (b).

[1]

The K-map can be used to simplify the function in part (a).

(ii) Draw loop(s) around appropriate groups to produce an optimal sum-of-products. [1]

(iii) Write a simplified sum-of-products expression, using your answer to part (ii).

S = [1]

(d) One Boolean identity is:

(A + B) . C = A . C + B . C

Simplify the expression for S in part (a) to the expression for S in part (c)(iii).

You should use the given identity and De Morgan’s Laws. [3]

Oct/Nov 2017.P31/P33

5 (a)(i) Complete the truth table for this 2-input NAND gate:

[1]

Page 15 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the truth table for this 3-input NAND gate:

[1]

(b) A SR flip-flop is constructed using two NAND gates.

(i) Complete the truth table for the SR flip-flop:

[3]

(ii) The final row in the table in part b(i) shows that the output for both Q and ̅Q is 1.

Explain why this is a problem. [2]

Page 16 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(c) Another type of flip-flop is the JK flip-flop.

A JK flip-flop is constructed as follows:

(i) Complete this truth table for the JK flip-flop.

[4]

(ii) Explain why the JK flip-flop is an improvement on the SR flip-flop. [2]

(d) Explain the role of flip-flops in a computer. [2]

Page 17 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Oct/Nov 2017.P32

5 (a) Complete the truth table for this NOR gate:

[1]

A SR flip-flop is constructed using two NOR gates.

(b) Complete the truth table for the SR flip-flop:

[4]

Page 18 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Another type of flip-flop is the JK flip-flop. The JK flip-flop is an improvement on the SR flip-flop.

(c)(i) The JK flip-flop has three inputs. Two of the inputs are the Set (J) and the Reset (K).

State the third input. [1]

(ii) There are two problems with the SR flip-flop that the JK flip-flop overcomes.

State each problem and state why it does not occur for the JK flip-flop. [4]

May/June 2018.P31/P33

4 (a) A Boolean expression produces the following truth table.

(i) Write the Boolean expression for the truth table as a sum-of-products.

X = [2]

Page 19 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the Karnaugh Map (K-map) for the truth table in part (a)(i).

[1]

The K-map can be used to simplify the function in part (a)(i).

(iii) Draw loop(s) around appropriate group(s) of 1s to produce an optimal sum-of-products for the table in
part (a)(ii). [2]

(iv) Write the simplified sum-of-products expression for your answer to part (a)(iii).

X = [2]

(b) A logic circuit with four inputs produces the following truth table.

Page 20 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(i) Complete the K-map that corresponds to the truth table.

[4]

(ii) Draw loop(s) around appropriate group(s) of 1s to produce an optimal sum-of-products for the table in
part (b)(i). [2]

(iii) Write the simplified sum-of-products expression for your answer to part (b)(ii).

X = [2]

Oct/Nov 2018.P31/P33

4 (a) A Boolean expression corresponds to the following truth table.

(i) Write the Boolean expression for the truth table by applying the sum-of-products.
X = [2]

Page 21 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the Karnaugh Map (K-map) for the truth table.

[1]

(iii) The K-map can be used to simplify the expression in part (a)(i).

Draw loop(s) around appropriate groups of 1s in the table in part (a)(ii) to produce an optimal
sum-of-products. [3]

(iv) Write the simplified sum-of-products expression for your answer to part (a)(iii).

X = [3]

Page 22 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) A logic circuit with four inputs produces the following truth table.

(i) Complete the K-map that corresponds to the truth table.

[4]

Page 23 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Draw loop(s) around appropriate groups of 1s in the table in part (b)(i) to produce an optimal
sum-of-products. [2]

(iii) Write the simplified sum-of-products expression for your answer to part (b)(ii).

X = ................................................................................................................................. [2]

Oct/Nov 2018.P32

3 (a) Consider the following Boolean expression.

A. B . C +A.B. C +A.B.C

Use Boolean algebra to simplify the expression. [4]

(b)(i) Complete the truth table for the following logic circuit.

Page 24 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

[2]

(ii) Complete the Karnaugh Map (K-map) for the truth table in part (b)(i).

[1]

(iii) Draw loops around appropriate groups of 1s in the table in part (b)(ii) to produce an optimal sum-of-
products. [2]

(iv) Using your answer to part (b)(iii), write a simplified sum-of-products Boolean expression.

X= [2]

Page 25 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(c) The truth table for a logic circuit with four inputs is shown.

(i) Complete the K-map for the truth table in part (c).

[4]

Page 26 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Draw loops around appropriate groups of 1s in the table in part (c)(i) to produce an optimal sum-of-
products. [2]

(iii) Using your answer to part (c)(ii), write a simplified sum-of-products Boolean expression.

X= [2]

May/June 2019.P31/P33

3 (a) The following logic circuit can be simplified to use only one gate.

Give the name of this single gate. [1]

(b) (i) Complete the truth table for the logic circuit.

Page 27 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

[2]

(ii) Give the name of the logic circuit that has this truth table. [1]

(iii) Give the uses for outputs X and Y. [2]

(c) Consider the following Boolean algebraic expression:

Use Boolean algebra to simplify the expression. Show your working. [5]

May/June 2019.P32

3 (a) A Boolean algebraic expression produces the following truth table.

Page 28 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(i) Complete the Karnaugh Map (K-map) for the truth table.

[1]

The K-map can be used to simplify the expression that produced the truth table in part (a).

(ii) Draw loops around appropriate groups of 1s in the K-map to produce an optimal sum-of-products. [2]

(iii) Write the simplified sum-of-products Boolean expression for the truth table. [2]

(b) A logic circuit with four inputs produces the following truth table.

Page 29 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(i) Complete the K-map for the truth table.

[4]

(ii) Draw loops around appropriate groups of 1s in the K-map to produce an optimal sum-of-products. [2]

(iii) Write the simplified sum-of-products Boolean algebraic expression for the truth table. [2]

Oct/Nov 2019.P31/P33

4 A Boolean expression produces the following truth table.

(a) Write the Boolean expression for the truth table as a sum-of-products. [2]

Page 30 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) Complete the Karnaugh Map (K-map) for the truth table above.

[1]

The K-map can be used to simplify the expression in part (a).

(c) Draw loops around appropriate groups in the K-map in part (b) to produce an optimal sum-of-products.
[2]

(d) Write, using your answer to part (c), a simplified sum-of-products expression for the truth table. [2]

Oct/Nov 2019.P32

2 (a) A Boolean expression produces the following truth table.

(i) Write the Boolean expression for the truth table by applying the sum-of-products. [3]

Page 31 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the Karnaugh Map (K-map) for the truth table in part (a).

The K-map can be used to simplify the function in part (a)(i).

(iii) Draw loop(s) around appropriate groups in the table in part (a)(ii), to produce an optimal sum-of-
products. [2]

(iv) Write, using your answer to part (a)(iii), a simplified Boolean expression for your Karnaugh map. [2]

(b) Simplify the following expression using De Morgan’s laws. Show your working.

[3]

May/June 2020.P31/P32/P33

4 (a) Write the Boolean algebraic expressions for the following logic circuit.

X=
Y=
[5]

Page 32 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) The logic circuit given in part (a) is a full adder.

(i) Give the purpose of outputs X and Y in this circuit. [2]

(ii) Give the use of the input R in this circuit. [1]

Oct/Nov 2020.P31/P33

4 The following truth table represents a logic circuit with three inputs and two outputs.

(a) Write the Boolean expressions for the truth table as sum-of-products.

X=

Y= [4]

(b) Complete the Karnaugh Maps (K-maps) for the truth table.

[2]

Page 33 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(c) The K-maps can be used to simplify one of the expressions in part (a).

(i) Draw loop(s) around appropriate group(s) of 1s to produce an optimal sum-of-products for the single
output table that can be simplified in part (b). [3]

(ii) Write the simplified sum-of-products expressions for this output from part (c)(i). [3]

(d) Identify the common logic circuit given by the truth table in part (a). Give the use of each output. [3]

Oct/Nov 2020.P32

4 The following truth table represents a logic circuit with three inputs and two outputs.

(a) Write the Boolean expressions for the truth table as sum-of-products.

X=
Y=
[3]

Page 34 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b) Complete the Karnaugh Maps (K-maps) for the truth table.

[2]

(c) The K-maps can be used to simplify one of the expressions in part (a).

(i) Draw loop(s) around appropriate group(s) of 1s to produce an optimal sum-of-products for the single
output table that can be simplified in part (b). [2]

(ii) Write the simplified sum-of-products expressions for this output from part (c)(i). [2]

5 Complete these statements about flip-flops.

A flip-flop is a .................................................... .

It has .................................................... stable states.

A flip-flop is used for .................................................... .

There are different types of flip-flop, for example .................................................... and

.................................................... . [5]

Page 35 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

May/June 2021.P31/P33

4 (a) The truth table for a logic circuit with four inputs is shown.

(i) Write the Boolean expression for the truth table as a sum-of-products.

X= [2]

Page 36 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the Karnaugh Map (K-map) for the truth table.

[2]

(iii) The K-map can be used to simplify the expression in part (a)(i).

Draw loops around appropriate groups of 1s in the table in part (a)(ii) to produce an optimal sum-of-
products. [2]

(iv) Write the simplified sum-of-products expression for your answer to part (a)(iii).

X= [2]

(b) Simplify your expression for X in part (a)(i) using Boolean algebra. Show your working. [2]

Page 37 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

May/June 2021.P32

4 (a) The truth table for a logic circuit with four inputs is shown.

(i) Write the Boolean expression for the truth table as a sum-of-products.

X= [2]

Page 38 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the Karnaugh Map (K-map) for the truth table.

[2]

(iii) The K-map can be used to simplify the expression in part (a)(i).

Draw loops around appropriate groups of 1s in the table in part (a)(ii) to produce an optimal sum-of-
products. [2]

(iv) Write the simplified sum-of-products expression for your answer to part (a)(iii).

X= [2]

(b) Simplify your expression for X in part (a)(i) using Boolean algebra. Show your working. [2]

5 Flip-flops are used in computer construction.

(a) Describe the role of flip-flops in a computer. [3]

(b) Describe the difference between an SR flip-flop and a JK flip-flop. [2]

Page 39 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Oct/Nov 2021.P31/P33

4 (a) The truth table for a logic circuit with four inputs is shown.

(i) Write the Boolean algebraic expression for the truth table as a sum-of-products.

X= [2]

Page 40 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the following Karnaugh Map (K-map) for the truth table.

[2]

(iii) The K-map can be used to simplify the expression in part (a)(i).

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

(iv) Write the simplified sum-of-products from the K-map.

X= [2]

(b) Simplify the expression for X, as represented by the truth table in part (a), using Boolean Algebra. [2]

Page 41 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Oct/Nov 2021.P32

3 (a) The truth table for a logic circuit with four inputs is shown.

(i) Write the Boolean algebraic expression for the truth table as a sum-of-products.

X=
[2]

Page 42 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(ii) Complete the following Karnaugh Map (K-map) for the truth table.

[2]

(iii) The K-map can be used to simplify the expression in part (a)(i).

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

(iv) Write the simplified sum-of-products from the K-map.

X= [2]

(b) Simplify the expression for X, represented by the truth table in part (a), using Boolean Algebra. [2]

Page 43 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

May/June 2021.P31/P32/P33 (9618)

7 The diagram shows a logic circuit.

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

[3]

(b) State the name of the logic circuit. [1]

(c) Write the Boolean expressions for the two outputs Y and Z in the truth table as sum-of-products and
state the purpose of each output. [4]

Page 44 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

Oct/Nov 2021.P31/P32/P33 (9618)

7 (a) Write the Boolean expression that corresponds to the given truth table as a sum-of-products.

Z= [3]

Page 45 of 46
Computer Science 9618
Topical Past Papers
Paper 3 - Questions

15.2 Boolean Algebra and Logic Circuits

(b)(i) Complete the Karnaugh map (K-map) for the given truth table.

[2]

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

(iii) Write the Boolean expression from your answer to part b(ii) as a simplified sum-of-products.

Z= [2]

(iv) Write the simplified Boolean expression for your answer to part b(iii).

Z= [1]

Page 46 of 46