Solution of Digital Circuit and Logic Design 1 Page 1/6

Homework#03 2005/2

Solution of Homework#03

(1) Use the theorems of switching algebra to simplify each of the following logic
functions:
(a) F = W·X·Y·Z· (W·X·Y·Z′ + W·X′·Y·Z + W′·X·Y·Z + W·X·Y′·Z)
F = W·X·Y·Z·W·X·Y·Z′ + W·X·Y·Z·W·X′·Y·Z + W·X·Y·Z·W′·X·Y·Z +
W·X·Y·Z·W·X·Y′·Z (according to T8)
= W·X·Y·0 + W·X·Y·Z·W·X′·Y·Z + W·X·Y·Z·W′·X·Y·Z +
W·X·Y·Z·W·X·Y′·Z (according to T5′)
=0+0+0+0 (according to T2′)
=0 (according to A4′)

(b) F = A·B + A·B·C′·D + A·B·D·E′ + A·B·C′·E + C′·D·E

F = A·B·(1 + C′·D + D·E′ + C′·E) + C′·D·E (according to T8)
= A·B·1 + C′·D·E (according to T2)
= AB + C′·D·E (according to T1′)

(c) F = M·N·O + Q′·P′·N′ + P·R·M + Q′·O·M·P′ + M·R

F = M·N·O + N′·P′·Q′ + M·O·P′·Q′ + M·R·(P+1) (according to T8)
= (M·O)·N + N′·(P′·Q′) + (M·O)·(P′·Q′) + M·R·1 (according to T2)
= (M·O)·N + N′·(P′·Q′) + M·R (according to T1′ and T11)
= M·N·O + N′·P′·Q′ + M·R

(2) Prove each of the following algebraically. Identify the axioms or theorems used at
each step
(a) A·B+A·B′ = A
A·B+A·B′ = A·(B+B′) (according to T8)
= A·(1) (according to T5)
= A (according to T1′)

(b) A + A·B = A
A + A·B = A·(1+B) (according to T8 and T5)
= A·1 (according to T2)
= A (according to T1′)

(c) A′ +A·B = A′ + B
A′ +A·B = A′ + ((A·B)′)′
= A′ + (A′ + B′)′
= (A·(A′ + B′))′
= (A·A′ + A·B′)′
= (0 + A·B′)′
= (A·B′)′
= A′+(B′)′
= A′+B
(according to T4)
(according to T13)
(according to T13)
(according to T8)
(according to T5′)
(according to T1)
(according to T13)
(according to T4)

Panupong Sornkhom Department of Electrical and Faculty of Engineering,

Computer Engineering Naresuan University
Solution of Digital Circuit and Logic Design 1 Page 2/6
Homework#03 2005/2

(d) A·B+B·C+A′·C = A′·C + A·B

A·B+B·C+A′·C = A·B·1 + B·C·1 + A′·C·1 (according to T1′)
= A·B·(C+C′) + B·C·(A+A′) + A′·C·(B+B′)
(according to T5)
= A·B·C + A·B·C′ + A·B·C + A′·B·C + A′·B·C + A′·B′·C
(according to T8)
= A·B·C + A·B·C′ + A′·B·C + A′·B′·C
(according to T3)
= A·B·(C+C′) + A′·C·(B+B′) (according to T8)
= A·B·1 + A′·C·1 (according to T5)
= A′·C + A·B (according to T1′)

(3) Write the truth table for each of the following logic functions:
(a) F = X′·Y + X′·Y′·Z

Row X Y Z F
0 0 0 0 0
1 0 0 1 1
2 0 1 0 1
3 0 1 1 1
4 1 0 0 0
5 1 0 1 0
6 1 1 0 0
7 1 1 1 0

(b) F = W′·X + Y′·Z′ + X′·Z

Row W X Y Z F
0 0 0 0 0 1
1 0 0 0 1 1
2 0 0 1 0 0
3 0 0 1 1 1
4 0 1 0 0 1
5 0 1 0 1 1
6 0 1 1 0 1
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1
10 1 0 1 0 0
11 1 0 1 1 1
12 1 1 0 0 1
13 1 1 0 1 0
14 1 1 1 0 0
15 1 1 1 1 0

Panupong Sornkhom Department of Electrical and Faculty of Engineering,

Computer Engineering Naresuan University
Solution of Digital Circuit and Logic Design 1 Page 3/6
Homework#03 2005/2

(c) F = (((A+B)′+C′)′+D)′

Row A B C D F
0 0 0 0 0 1
1 0 0 0 1 0
2 0 0 1 0 1
3 0 0 1 1 0
4 0 1 0 0 1
5 0 1 0 1 0
6 0 1 1 0 0
7 0 1 1 1 0
8 1 0 0 0 1
9 1 0 0 1 0
10 1 0 1 0 0
11 1 0 1 1 0
12 1 1 0 0 1
13 1 1 0 1 0
14 1 1 1 0 0
15 1 1 1 1 0

(4) Find the dual for each of the following

(a) A+B′ = A+ A′·B′
A·B′ = A·(A′+B′)

(b) A·B′ + A′·B + A·B = A + B

(A+B′)·(A′+B)·(A+B) = A·B

(c) A·C′ + B·C′ = ((A+B)′ + C)′

(A+C′)·(B+C′) = ((A·B)′·C)′

(5) Write the canonical sum and product for each of the following logic functions:
(a) F = ΣX,Y(1,2)
Canonical sum = X′·Y + X·Y′
Canonical product = (X+Y)·(X′+Y′)

(b) F = ΠA,B(0,1,2)
Canonical sum = A·B
Canonical product = (A+B)·(A′+B)·(A+B′)

(c) F = ΣX,Y,Z (0,3)

Canonical sum = X′·Y′·Z′ + X′·Y·Z
Canonical product
= (X+Y+Z′)·(X+Y′+Z)·(X′+Y+Z)·(X′+Y+Z′)·(X′+Y′+Z) ·(X′+Y′+Z′)

(d) F = ΠA,B,C (1,2,4)

Canonical sum = A′·B′·C′+A′·B·C+ A·B′·C + A·B·C′ + A·B·C
Canonical product = (A+B+C′)·(A+B′+C)·(A′+B+C)

Panupong Sornkhom Department of Electrical and Faculty of Engineering,

Computer Engineering Naresuan University
Solution of Digital Circuit and Logic Design 1 Page 4/6
Homework#03 2005/2

(e) F = X + Y′·Z′
Canonical sum = X′·Y′·Z′ + X·Y′·Z′ + X·Y′·Z + X·Y·Z′ + X·Y·Z
Canonical product
= (X+Y+Z′)·(X+Y′+Z)·(X+Y′+Z′)

(f) F = A′·B + B′·C + A

Canonical sum
= A′·B′·C+A′·B·C′+A′·B·C+ A·B′·C′+ A·B′·C+ A·B·C′+ A·B·C
Canonical product
= (A+B+C)

(6) Given the function P(A, B, C) = ΣA, B, C(0, 1+x, 3+x, 4+x) where x = y mod 4 and
y = sum of all digits in your telephone number
(a) Express P in canonical forms
My telephone number = 012830195
y = 0+1+2+8+3+0+1+9+5 = 29
x = y mod 4 = 29 mod 4 = 1
P(A, B, C) = ΣA, B, C(0, 2, 4, 5)
Canonical sum = A′·B′·C′+A′·B·C′+A·B′·C′+ A·B′·C
Canonical product = (A+B+C′)·(A+B′+C′)·(A′+B′+C)·(A′+B′+C′)

(b) Implement simplified P using AND, OR, and NOT gates

P = A′·B′·C′+A′·B·C′+A·B′·C′+ A·B′·C
= A′·C′·(B′+B) + A·B′·(C′+C)
= A′·C′+A·B′

(c) Implement simplified P using AND and NOT gates only

P = A′·C′+A·B′
= ((A′·C′+A·B′)′)′
= ((A′·C′)′·(A·B′)′)′

Panupong Sornkhom Department of Electrical and Faculty of Engineering,

Computer Engineering Naresuan University
Solution of Digital Circuit and Logic Design 1 Page 5/6
Homework#03 2005/2

(d) Implement simplified P using OR and NOT gates only

P = A′·C′+A·B′
= (A+C)′+(A′+B)′

(7) An Exclusive OR (XOR) gate is a 2-input gate whose output is 1 if and only if
exactly one of its inputs is 1. Write the truth table, sum-of-products expression, and
corresponding AND-OR circuit for the Exclusive OR function

X Y F F = X′·Y + X·Y′
0 0 0
0 1 1
X
1 0 1
1 1 0
Y

(8) Any set of logic-gate types that can realize any logic function is called a complete
set of logic gates. For example, 2-input AND gates, 2-input OR gates, and inverters
are a complete set, because any logic function can be expressed as a sum of products
of variables and their complements, and AND and OR gates with any number of
inputs can be made from 2-input gates. Do 2-input NAND gates form a complete set
of logic gates? Prove your answer.
Yes, 2-input NAND gates form a complete set of logic gates because 2-
input AND gates, 2-input OR gates, and inverters are a complete set and we can
derive logic function AND, OR, and NOT (inverter) from 2-input NAND gates.
Panupong Sornkhom Department of Electrical and Faculty of Engineering,
Computer Engineering Naresuan University
Solution of Digital Circuit and Logic Design 1 Page 6/6
Homework#03 2005/2

(9) Draw a truth table to show the function of an odd number detection circuit. That
is, the output of the circuit will be one only if the decimal value of the binary input is
odd. Assume three inputs. Derive a simplified circuit

X Y Z F F = X′·Y′·Z + X′·Y·Z + X·Y′·Z + X·Y·Z

0 0 0 0 = X′·Z·(Y′+Y) + X·Z·(Y′+Y)
0 0 1 1 = X′·Z + X·Z
0 1 0 0 = Z·(X′ + X) = Z
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

Panupong Sornkhom Department of Electrical and Faculty of Engineering,

Computer Engineering Naresuan University