Scribd
Upload
706 views

Boolean Practice

This document contains solutions to Boolean logic practice problems involving simplifying and reducing Boolean expressions and obtaining truth tables. The problems cover topics such as using Boolean algebra to prove and simplify expressions, reducing expressions to a minimum number of literals, obtaining complements of expressions, and converting between truth tables and Boolean expressions.

Uploaded by

Anjalika Hansi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
706 views

Boolean Practice

This document contains solutions to Boolean logic practice problems involving simplifying and reducing Boolean expressions and obtaining truth tables. The problems cover topics such as using Boolean algebra to prove and simplify expressions, reducing expressions to a minimum number of literals, obtaining complements of expressions, and converting between truth tables and Boolean expressions.

Uploaded by

Anjalika Hansi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

CSE320 Boolean Logic Practice Problems

Solutions
1.

Prove the following Boolean expression using algebra.


A. XY + XY + XY = X + Y
= (XY+ XY ) + (X Y + XY) replication of term XY
= X(Y + Y) + Y(X + X)
= X + Y
B. AB + BC + AB + BC = 1
= (AB+ AB) + (BC+ BC)
= B(A + A) + B(C + C)
= B + B
=1
C. Y + XZ + XY = X + Y + Z
= Y + X Y + X Z
= Y(1 + X) + XY + XZ
= (Y + X)(Y + Y) + XZ
= Y + X + XZ
= Y + (X + X)(X + Z)
=X+Y+Z
D. XY + YZ + XZ + XY + YZ = XY + XZ + YZ
= X Y + Y Z(X + X) + XZ + XY + Y Z
= X Y + X Y Z + X Y Z + XZ + XY + Y Z
= X Y (1 + Z) + X Y Z +XZ + XY + Y Z
= X Y + XZ(1 + Y) + XY + Y Z
= X Y + XZ + XY (Z + Z)+ Y Z
= X Y + XZ + XY Z +Y Z (1 + X)
= X Y + XZ(1 + Y) + Y Z
= X Y + XZ + Y Z
E. AB + ACD+ ABD + ABCD = B + ACD
= AB(C+C)(D+D) + ACD(B+B) + ABD(C+C) + ABCD
= ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD
= ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD+ ABCD +
ABCD
= B(A+A)(C+C)(D+D) + ACD(B+B)
= B+ACD
Alternate approach:
AB + ACD + ABD + ABCD
= B (A + ACD + AD + ACD) + ACD
(replicate ACD) (ACD hides B)
= B(A + A (CD + D + CD) + ACD
= B(A + A( D+ D(C+C)) + ACD
= B(A + A(D+D(1)) + ACD
= B(A + A(D+D) ) + ACD
= B(A + A(1)) + ACD
= B(A + A) + ACD
= B(1) + ACD
= B+ACD
F. XZ + WYZ+WYZ+WXZ =
XZ + WYZ + WXY + WXY + XYZ
= XZ(W+W)(Y+Y) + WYZ(X+X) + WYZ(X+X) + WXZ(Y+Y)
= XZ(W+W)(Y+Y): WXYZ + WXYZ + WXYZ + WXYZ
WYZ(X+X): WXYZ + WXYZ

WYZ(X+X): WXYZ + WXYZ


WXZ(Y+Y): WXYZ + WXYZ
= WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ
= *XZ(W+W)(Y+Y): WXYZ + WXYZ + WXYZ + WXYZ
*WYZ(X+X): WXYZ + WXYZ
WXY(Z+Z): WXYZ + WXYZ
WXY(Z+Z): WXYZ + WXYZ
XYZ(W+W): WXYZ + WXYZ
= XZ(W+W)(Y+Y) + WYZ(X+X) + WXY(Z+Z) + WXY(Z+Z) + XYZ(W+W)
G. CD + AB + AC + AC + AB + CD =
(A + B + C + D)(A + B + C + D)
= CD(A+A)(B+B) + CD(A+A)(B+B) + AB(C+C)(D+D) + AB(C+C)(D+D) + AC(B+B)(D+D)+
AC(B+B)(D+D)
= CD(A+A)(B+B): ABCD + ABCD + ABCD + ABCD
CD(A+A)(B+B): ABCD + ABCD+ ABCD + ABCD
AB(C+C)(D+D): ABCD + ABCD + ABCD + ABCD
AB(C+C)(D+D): ABCD + ABCD + ABCD + ABCD
AC(B+B)(D+D): ABCD + ABCD + ABCD + ABCD
AC(B+B)(D+D): ABCD + ABCD + ABCD + ABCD
= ABCD + ABCD + ABCD + + ABCD + ABCD + ABCD + ABCD + ABCD + + ABCD + ABCD
+ ABCD + ABCD + ABCD + ABCD + ABCD

= *AB(C+C)(D+D): ABCD + ABCD + ABCD + ABCD


*AC(B+B)(D+D): ABCD + ABCD + ABCD + ABCD
AD(B+B)(C+C): ABCD + ABCD+ ABCD + ABCD
*AB(C+C)(D+D): ABCD + ABCD + ABCD + ABCD
BC(A+A)(D+D): ABCD + ABCD + ABCD + ABCD
BD(A+A)(C+C): ABCD + ABCD + ABCD + ABCD
*AC(B+B)(D+D): ABCD + ABCD + ABCD + ABCD
BC (A+A)(D+D): ABCD + ABCD + ABCD + ABCD
*CD(A+A)(B+B): ABCD + ABCD + ABCD + ABCD
AD(B+B)(C+C): ABCD + ABCD + ABCD + ABCD
BD(A+A)(C+C): ABCD + ABCD + ABCD + ABCD
*CD(A+A)(B+B): ABCD + ABCD ABCD + ABCD
= AB(C+C)(D+D) + AC(B+B)(D+D) + AD(B+B)(C+C) + AB(C+C)(D+D) + BC(A+A)(D+D)+
BD(A+A)(C+C) + AC(B+B)(D+D) + BC (A+A)(D+D)+ CD(A+A)(B+B) + AD(B+B)(C+C) +
BD(A+A)(C+C) + CD(A+A)(B+B)
= AB + AC + AD + AB + BC+ BD + AC + BC + CD + AD + BD + CD
= AA + AB + AC + AD + AB + BB +BC + BD + AC + BC + CC + CD + AD + BD + CD + DD
= (A +B + C + D) (A + B + C + D)
Note that the * denotes lines which are the same as in step 2. All other terms are repeats. Also, note that the only term missing is
ABCD this implies that the truth table has only 1 zero (0010). The function can be represented as M(2).
2.

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.

Find the complement of the following expressions


A. AB + AB
= (A +B)(A+B)
B. (VW +X)Y +Z
= ((V+W)X+Y)Z
C. WX(YZ+YZ) + WX(Y + Z)(Y +Z)
= [W+X+(Y+Z)(Y+Z)][W+X+YZ+YZ]
D. (A +B + C)(AB + C)(A + BC) = ABC+(A+B)C+A(B+C)

5.

Obtain the truth tables for the following expressions


A. Z = (XY + Z)(Y + XZ)
X
Y
Z
Z
0
0
0
0
0
0
1
0
0
1
0
0
0
1
1
1
1
0
0
0
1
0
1
1
1
1
0
1
1
1
1
1
B. Z = (A + B)(B + C)
X
Y
Z
0
0
0
0
0
1
0
1
0
0
1
1
1
0
0
1
0
1
1
1
0
1
1
1

C.

Z
1
1
0
1
0
0
0
1

Z = WXY + WXZ + WXZ +YZ'


W
X
Y
Z
Z
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

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

Using DeMorgans theorem, express the function


F = ABC + AC + AB
a. with only OR and complement operators
b. with only AND and complement operators
Solution:
a. F = (A + B + C) + (A+C) + (A+B) = (A+B+C) + (A + (B + C))
b. F = (ABC)(AC)(AB) or [(ABC) (A(BC))]

Minterms & Maxterms


8.

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

sum-of-minterms: XYZ + XYZ + XYZ + XYZ


product-of-maxterms: (X + Y + Z) (X + Y + Z)
(X + Y +Z)(X + Y + Z)
b.

sum-of-minterms:ABC + ABC + ABC + ABC


product-of-maxterms: (A + B+ C) (A + B + C)
(A + B + C)(A + B + C)

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)

=A(B+EF) + BC(B+EF) + CD(B+EF)


= AB + AEF + BCEF + BCD + CDEF

(SOP)

10. Convert the following gate diagrams into (1) switching expression, (2) truth table, (3) sum-of-products, and (4) product-ofsums

(1) switching expression : WXY + WZ + XY


(2)
W
X
Y
0
0
0
0
0
0
0
0
1
0
0
1
0
1
0
0
1
0

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)

(1) switching expression : W(XY+XY) + Y(XZ+XZ)


(2)
W
X
Y
Z
B
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
0
0
1
1
1
1
1
0
0
0
0
1
0
0
1
0
1
0
1
0
1
1
0
1
1
1
1
1
0
0
1
1
1
0
1
1
1
1
1
0
0
1
1
1
1
1
(3) sum-of-products: 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)(W+X+Y+Z)(W+X+Y+Z)

(1) switching expression : WY(X+Z) +XY(W+Z) + WZ(X+Y)


(2)
W
X
Y
Z
C
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
0
0
1
1
1
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
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
0
(3) sum-of-products: 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)(W+X+Y+Z)(W+X+Y+Z)
11. Simplify/write the following expressions in (1) sum-of-products and (2) product-of-sums forms
g. AC + BD + ACD + ABCD
= AC + BD( 1 + AC) + ACD(B+B)A+ ABCD
= AC + BD + ABCD + ABCD + ABCD + ABCD
= AC + BD + CD(AB + AB + AB + AB)
= CD + AC+BD
(SOP)
= (C+D)(A+D)(A+B+C)
(POS)
h. (A + B + D)(A + B + C)(A + B + D)(B + C + D)
= AC+BD +AD
(SOP)
= (C+D)(A+D)(A+B+C)
(POS)
i. (A + B + D)(A + D)(A + B + D)(A + B + C + D))
= ABD+BD +ABC or ABD+BD +ACD
(SOP)
= (A+B)(B+D)(B+C+D)
(POS)
j. F(A,B,C,D) = m(2,3,5,7,8,10,12,13)
= ABCD+ ABCD+ ABCD +ABCD +ABCD+ABCD+ABCD+ABCD
= ABD+ABC+ABD+ABC+BCD (there are multiple answers) (SOP)
= (A+B+D)(B+C+D)(A+B+C)(A+C+D)(A+B+C) (there are multiple answers) (POS)

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

l. List the minterms and maxterms of each function


E = m(0,1,2,5)
F = m(2,3,6,7)
E = M(3,4,6,7)
F = M(0,1,4,5)

G = m(0,1,2,4,6)
G = M(3,5,7)

m. List the maxterms of E, F, and G


E = M (0,1,2,5)
E = m (3,4,6,7)

G = M (0,1,2,4,6)
G = m (3,5,7)

n.

Write the truth tables for E + F and EF


X
Y
0
0
0
0
0
1
0
1
1
0
1
0
1
1
1
1

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.

List the minterms of E + F and EF


E+F = m(0,1,2,3,5,6,7) =XYZ+XYZ+XYZ+XYZ+XYZ+XYZ+XYZ
EF =m(2) = XYZ

p.

Express E, F and G in sum-of-products


E = XYZ + XYZ + XYZ + XYZ
F = XYZ + XYZ + XYZ + XYZ
G = XYZ + XYZ + XYZ + XYZ + XYZ

q.

Express E, F and G in products-of-sums


E = (X+Y+Z)(X + Y + Z) (X+Y+Z)(X + Y + Z)
F = (X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)
G = (X+Y+Z)(X+Y+Z)(X+Y+Z)

r.

Simplify E, F and G to expressions with a minimum number of literals (sum-of-products).


E = XYZ + XYZ + XYZ + XYZ
= XZ(Y+Y) + YZ(X+X)
= YZ + XZ
F = XYZ + XYZ + XYZ + XYZ
= YZ(X+X) + YZ(X+X)
= Y(Z + Z) = Y
G= XYZ + XYZ + XYZ + XYZ + XYZ
=XY(Z+Z) + Z(XY +XY +XY + XY) duplicate XYZ
= XY + Z

You might also like