Digital Circuits: Homeworks #2 Solutions

1. Truth Table.
Construct a truth table of following Boolean expressions

(a) X = AB + B̄C + CA.

(b) X = (A + B)(B + C̄)(C + A).

Solution: Truth Table

(a) X = AB + B̄C + CA.

A B C X
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
(b) X = (A + B)(B + C̄)(C + A).
A B C X
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

2. Standard Forms of Boolean Expressions

(a) Convert X = (A + C)(CD + AC) to sum-of-product (SOP) form.

(b) Convert X = (A + C)(CD + AC) to product-of-sum (POS) form.
(c) Convert X = AB(CD + ĒF )(AB + CD) to sum-of-product (SOP) form.

Solution: Standard Forms of Boolean Expressions.

Homework 2 Page 1 of 5
 (a) We have

X =ACD + CCD + AAC + CAC (1)

=ACD + CD + AC + AC (2)
=ACD + CD + AC (3)
=AC + CD (4)

(b) It is clear that

X = (A + C)C(D + A). (5)

Note that this can be further simplifed as

X = C(A + D). (6)

(c) We have

X =AB(CD + ĒF )(AB + CD) (7)

=AB + CD + ĒF + AB + CD (8)
=AB + CDĒF + ABCD (9)
=AB + (C̄ + D̄)(E + F̄ ) + ABCD (10)
=AB + C̄E + D̄E + C̄ F̄ + D̄F̄ + ABCD. (11)

3. Karnaugh Map
Let X = AB̄ + B C̄ + CD + AC D̄.

(a) Develop a truth table of X

(b) Use a Karnaugh map to reduce X to a minimum SOP form.
(c) Use a Karnaugh map to reduce X to a minimum POS form.

Solution: Karnaugh Map.

(a) X = AB̄ + B C̄ + CD + AC D̄.

Homework 2 Page 2 of 5
 A B C D X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
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

Figure 1: Problem 3

(b) It is not hard to show that X = A + B C̄ + CD.

(c) It is not hard to show that X = (A + B + C)(A + C̄ + D).

4. Karnaugh Map 2
Let X = (Ā + B)(Ā + B̄ + C̄)(B + C̄ + D)(A + B̄ + C + D̄).

(a) Develop a truth table of X

(b) Use a Karnaugh map to reduce X to a minimum SOP form.
(c) Use a Karnaugh map to reduce X to a minimum POS form.

Solution: Karnaugh Map 2.

(a) X = (Ā + B)(Ā + B̄ + C̄)(B + C̄ + D)(A + B̄ + C + D̄).

Homework 2 Page 3 of 5
 A B C D X
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 0
1 1 1 1 0

Figure 2: Problem 4

(b) It is not hard to show that

X = AB C̄ + ĀC̄ D̄ + ĀB̄D + ĀBC. (12)

(c) It is not hard to show that

X = (Ā + B)(Ā + C̄)(B + C̄ + D)(A + B̄ + C + D̄). (13)

5. Don’t Care!
For the following truth table, answer the following questions. Note that “x” means
don’t care.

Homework 2 Page 4 of 5
 A B C D X
0 0 0 0 x
0 0 0 1 x
0 0 1 0 0
0 0 1 1 0
0 1 0 0 x
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 x
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

(a) Draw a K-map (show all 0s, 1s, and x’s).

(b) Derive a minimum SOP expression using K-map.
(c) Derive a minimum POS expression using K-map.

Solution: Don’t Care!

(a) K-map:

Figure 3: Problem 5

(b) It is not hard to show that

X = AB + BD. (14)
(c) It is not hard to show that
X = B(A + D) (15)

Homework 2 Page 5 of 5