(a) Write the Boolean expression that corresponds to the given truth table as a sum-of-products. INPUT OUTPUT A B C D Z 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 Z =

1. (a)Write the Boolean expression that corresponds to the given truth table as a sum-of-products. INPUT OUTPUT A B C D Z 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 Z = [3]
2. (b)(i)Complete the Karnaugh map (K-map) for the given truth table. [Figure 7.1][2]
3. (b)(ii)Draw loop(s) around appropriate group(s) of 1s in the K-map to produce an optimal sum-of-products.[2]
4. (b)(iii)Write the Boolean expression from your answer to part b(ii) as a simplified sum-of-products. Z = [2]
5. (b)(iv)Write the simplified Boolean expression for your answer to part b(iii). Z = [1]

This question uses a diagram from the original paper, which isn't shown here. Open the full paper from the past papers archive to see it.