Q.
1 (9608/32/M/J/15)
......................................................................................................................[1]
1
(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:
(d) Using De Morgan’s laws and Boolean algebra, simplify your answer
to part (c). Show all your working.
.......................................................................................................................................
.....
.......................................................................................................................................
.....
.......................................................................................................................................
.....
2
.......................................................................................................................................
.....
......................................................................................................................................
.....
.......................................................................................................................[3]
3
(9608/31/M/J/17)
2. Consider the following logic circuit, which contains a redundant logic gate.
(a) Write the Boolean algebraic expression corresponding to this logic circuit. X =
..................................................................................................................[3]
(b)Complete the truth table for this logic circuit.
(c) (i) Complete the Karnaugh Map (K-map) for the truth table in part (b).
(ii) Draw loop(s) around appropriate groups to produce an optimal sum-of-
products. [2]
4
(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
Simplify the expression for X in part (a) to the expression for X in part (c)(iii). You
should use the given identity.
............................................................................................................................................
............................................................................................................................................
............................................................................................................................................
. [2]
(9608/31/M/J/18)
3 (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]
5
(ii)Complete the Karnaugh Map (K-map) for the truth table in part (a)(i).
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.
6
(i) Complete the K-map that corresponds to the truth table.
(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]
