ITDR2102: Computer Organization – Tutorial Answers

Tutorial 4
From Lecture 4 (Combinational Logic)

1. Your goal is to design a circuit which has as input a number 0-9 represented in binary form.
The inputs are labeled A, B, C, D where A is the most significant bit. 10-15 represent "don't
care" conditions. The output is the sum of 3 and the input represented in binary form. The
outputs are labeled W, X, Y, Z where W is the most significant bit.
a. Create a truth table for the circuit.
Answer:
INPUT OUTPUT
A B C D W X Y Z
0 0 0 0 0 3 0 0 1 1
1 0 0 0 1 4 0 1 0 0
2 0 0 1 0 5 0 1 0 1
3 0 0 1 1 6 0 1 1 0
4 0 1 0 0 7 0 1 1 1
5 0 1 0 1 8 1 0 0 0
6 0 1 1 0 9 1 0 0 1
7 0 1 1 1 10 1 0 1 0
8 1 0 0 0 11 1 0 1 1
9 1 0 0 1 12 1 1 0 0
10 1 0 1 0 X X X X
11 1 0 1 1 X X X X
12 1 1 0 0 X X X X
13 1 1 0 1 X X X X
14 1 1 1 0 X X X X
15 1 1 1 1 X X X X

b. Complete the Karnaugh maps for W and Y, minimizing the Boolean functions.
Answer:

W = B.C + B.D + A Y = C’.D’ + C.D

Page 1
 ITDR2102: Computer Organization – Tutorial Answers

c. Write the Boolean equations for W and Y from the K-maps.

Answer:
W = B.C + B.D + A
Y = C’.D’ + C.D

2. Implement the following truth table directly (without any minimization) using a PLA. Properly
label the inputs and outputs.

Inputs Outputs
A B C D X Y Z
0 0 0 0 1 0 0
0 0 0 1 0 1 0
0 0 1 0 0 0 1
0 0 1 1 0 0 1
0 1 0 0 0 1 0
0 1 0 1 1 0 0
0 1 1 0 0 0 1
0 1 1 1 0 0 0
1 0 0 0 0 1 1
1 0 0 1 0 0 0

Answer:

Page 2