Boolean Practice
Boolean Practice
Solutions
1.
Simplify the following Boolean expressions to the minimum number of literals (total number of appearances of all variables,
eg. AB+C has 3 literals).
A. ABC + ABC + AB
=B
B. (A + B)(A + B)
= AB
C. ABC + AC
= AC + BC
D. BC + B(AD + AD)
E. (A + B + AB)(AB + AC +BC)
3.
= B(C + A)
= AB + ABC
Reduce the following expressions to the indicated number of literals (total number of appearances of all variables, eg. AB+C
has 3 literals).
A. XY + XYZ + XY to 3 literals
= X + XYZ = (X + XY)(X + Z)
= (X + X)(X + Y)(X + Z) = (X + Y)(X + Z)
= X+YZ
B. X + Y(Z + (X + Z)) to 2 literals
= X + Y(Z + X Z) = X + YZ + XYZ = X + (YZ + X)(YZ + YZ)
= X + Y(X + YZ) = X + XY + YZ = (X + X)(X + Y) + YZ
= X + Y + YZ
= X +Y
C. WX(Z + YZ) + X(W + WYZ) to 1 literals
= WXZ + WXYZ + WX + WXYZ = WX + WXZ + WXZ
= WX + WX = X
D. ((A + B) + AB)(CD + CD) + AC to 4 literals
= ABCD + ABCD + ABCD + ABCD + A + C
= A( 1+ BCD + BCD) + C(1 + ABD) + ABCD
= A(1 + BCD) + C+ ABCD = A + ABCD + C + ABCD
= A + C + (A+A)BCD
= A + C(1 + BD) + BCD = A + C + BCD + BCD
= A + C+ (C+C)(BD)
= A + C+ BD
4.
5.
C.
Z
1
1
0
1
0
0
0
1
6.
Convert the following truth table to switching expression (Boolean Algebra), and simplify the expression as much as possible
X
Y
0
0
0
0
0
1
0
1
1
0
1
0
1
1
1
1
E = X + YZ
7.
Z
0
1
0
1
0
1
0
1
X
0
0
0
0
1
1
1
1
G=Y
E
0
1
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
G
0
0
1
1
0
0
1
1
Write the truth table for the following functions, and express the functions as sum-of-minterms and product-of-maxterms
c. (XY + Z)(Y + XZ)
a. (A + B)(B + C)
b. WXY + WXZ + WXZ + YZ
Solution:
a.
X
0
0
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
a
0
0
0
1
0
1
1
1
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
b
1
1
0
1
0
0
0
1
c.
W
X
Y
Z
c
0
0
0
0
0
0
0
0
1
0
0
0
1
0
1
0
0
1
1
0
0
1
0
0
0
0
1
0
1
0
0
1
1
0
1
0
1
1
1
0
1
0
0
0
0
1
0
0
1
0
1
0
1
0
1
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
sum-of-minterms: WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ
product-of-maxterms:(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)(W+X+Y+Z)
9.
Convert the following expressions into sum-of-products (minterms) and product-of-sums (maxterms)
d. (AB +C)(B + CD)
= AB + ABCD + BC + CCD = AB + ABCD + BC = AB(1+CD) + BC
= AB +BC
(SOP)
= B(A+C) = (B+B)(A+C) (POS)
e.
X + X(X + Y)(Y + Z)
= (X+X) (X + (X + Y))(Y+Z) = (X + X + Y)(X + Y + Z)
= X + Y + Z
(SOP & POS)
f.
(A + BC + CD)(B + EF)
= (A + BC + CD)(B+E)(B+F)
= (A + B + C) (A + B + D) (A + C+D)(B+E) (B+F)
(POS)
(SOP)
10. Convert the following gate diagrams into (1) switching expression, (2) truth table, (3) sum-of-products, and (4) product-ofsums
Z
0
1
0
1
0
1
A
0
1
0
1
0
1
0
1
1
0
1
0
1
1
1
1
1
0
0
0
1
1
0
0
1
1
1
0
1
0
0
1
0
1
1
0
1
1
0
0
0
1
1
0
1
0
1
1
1
0
1
1
1
1
1
1
(3) sum-of-products: WXYZ+ WXYZ +WXYZ + WXYZ+ WXYZ +WXYZ + WXYZ+ WXYZ +
WXYZ
(4) product-of-sums: (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)
k. F(W,X,Y,Z) = M(2,10,13)
= YZ + WX + XZ + XY
= (W+X+Y+Z)(X+Y+Z)
(SOP)
(POS)
12. For the Boolean functions given in the following truth table:
X
Y
Z
E
0
0
0
1
0
0
1
1
0
1
0
1
0
1
1
0
1
0
0
0
1
0
1
1
1
1
0
0
1
1
1
0
F
0
0
1
1
0
0
1
1
G
1
1
1
0
1
0
1
0
G = m(0,1,2,4,6)
G = M(3,5,7)
G = M (0,1,2,4,6)
G = m (3,5,7)
n.
F = M (2,3,6,7)
F = m (0,1,4,5)
Z
0
1
0
1
0
1
0
1
E
1
1
1
0
0
1
0
0
F
0
0
1
1
0
0
1
1
E+F
1
1
1
1
0
1
1
1
EF
0
0
1
0
0
0
0
0
o.
p.
q.
r.