Scribd
Upload
2K views

Assignment2 Solution 3rd Edition

This document contains solutions to assignment problems from Chapter 2 of Digital Design by M. Mano. It includes simplifying Boolean expressions, finding complements, converting between sum of products and product of sums forms, and showing properties of binary operations. Example problems are solved step-by-step using Boolean algebra rules and truth tables.

Uploaded by

Mohamad Syazwan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
2K views

Assignment2 Solution 3rd Edition

This document contains solutions to assignment problems from Chapter 2 of Digital Design by M. Mano. It includes simplifying Boolean expressions, finding complements, converting between sum of products and product of sums forms, and showing properties of binary operations. Example problems are solved step-by-step using Boolean algebra rules and truth tables.

Uploaded by

Mohamad Syazwan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ECE-223, Solutions for Assignment #2

Chapter 2, Digital Design, M. Mano, 3rd Edition

2.2) Simplify the following Boolean expression to a minimum number literals: a) xy + xy b) (x + y)(x + y) c) xyz + xy + xyz d) (A+B)(A+B)

a) xy + xy = x ( y+y)= x.1 = x b) (x+y)(x+y) = xx + xy + yx+yy = x + xy + xy + 0 = x (1+ y + y) = x.1= x Also (x+y)(x+y) =x+ yy = x + 0 = x c) xyz + xy + xyz = xy(z+z) + xy = xy +xy = y(x+x)=y d) (A+B)(A+B)= (AB).(AB) = 0

2.3) Simplify the following Boolean expression to a minimum number literals: a) ABC + AB + ABC b) xyz + xz c) (x+y)(x+y) d) xy + x(wz + wz) e) (BC+AD)(AB+CD)

a) b) c) d) e)

ABC + AB + ABC = AB(C+C) + AB = AB + AB = B(A+A) = B xyz + xz = z(xy+x)= z(x+x)(x+y) = z(x+y) (x+y)(x+y) = xy.(x+y) = xy+xy = xy xy + x(wz + wz) = xy + xw(z+z) = xy + xw = x(y+w) (BC+AD)(AB+CD)= ABBC + ABAD + CDBC + CDAD = 0

2.6) Find the complement of the following expressions: a) xy+xy b) ( AB+C)D+E c) (x+y+z)(x+z)(x+y)

Page:

a) [xy+xy] = (xy) + (xy) = (x+y).(x+y) = xx + yy b) [(AB+C)D+E] = [(AB+C)D].E = [(AB+C)+D] . E= [(A+B).C +D].E = = (A+B+D).(C+D).E c) [(x+y+z)(x+z)(x+y)] = (x+y+z)+(x+z)+(x+y)= xyz + xz + xy

2.7) Given Boolean function F1 and F2. a) Show that the Boolean function E = F1+F2 contains the sum of the minterms of F1 and F2 b) Show that the Boolean function G = F1.F2 contains the sum of the minterms of F1 and F2 F1= mi and F2= mj a) E = F1+ F2= mi + mj = (mi + mj) b) G = F1F2 = mi . mj mi.mj = 0 if i j mi.mj = 1 if i = j Therefore G has only common minterms.

2.14) Obtain the truth table of the following functions and express each function in sum of minterms and product of maxterms: a) (xy + z) ( y + xz) b) (A + B) (B+C) c) yz + wxy + wxz + wxz a) (xy + z) ( y + xz) = xy + yz + xyz + xz =(3,5,6,7) = ( 0 ,1,2,4) b) (A + B) (B+C) = AB + AC + BC = (0,1,3,7) = ( 2,4,5,6) c) yz + wxy + wxz + wxz = (1,3,5,9,12,13,14)= (0,2,4,6,7,8,10,11,15)

2-15) Given the Boolean function F= xyz + xyz + wxy + wxy + wxy a) Obtain the truth table of the function. b) Draw the logic diagram using the original Boolean expression.

Page:

c) Simplify the function to a minimim number of literals using Boolean algebra. d) Obtain the truth table of the function from the simplified expression and show that it is the same as the one in part (a) e) Draw the logic diagram from the simplified expression and compare the total number of gates with the diagram of part (b) a) F(w,x,y,z) = ( 1,5,6,7,9,10,11,13,14,15) b) F= xyz + xyz + wxy + wxy + wxy 5 3-input AND gate; 5 3-input OR gate c) F = yz(x+x) + xy(w+w) + wy(x+x) = yz + xy + wy = yz + y ( x + w) d) F(w,x,y,z) = ( 1,5,6,7,9,10, 11,13,14,15) e) y'
z F x w y

2.17) Express the complement of the following function in sum of minterms: a) F(A,B,C,D) = (0,2,6,11,13,14) b) F(x,y,z) = (0,3,6,7) a) F(A,B,C,D) = (1,3,4,5,7,8,9,10,12,15) b) F(x,y,z) = (0,3,6,7)

2.18) Convert the following to the other canonical form: a) F(x,y,z) = (1,3,7) b) F(A,B,C,D) = (0,1,2,3,4,6,12) a) F(x,y,z) = (1,3,7) = (0,2,4,5,6) b) F(A,B,C,D) = (0,1,2,3,4,6,12) = (5,7,8,9,10,11,13,14,15)

Page:

2.22) By substituting the Boolean expression equivalent of the binary operation as defined in Table 2-8 ( Digilal Design, M. Mano, 3rd Edition,pp. 57) show the following: a) The inhibition operation is neither commutative nor associative. b) The exclusive-OR operation is commutative and associative. a) x/y = xy y /x = xy Not Commutative (x/y)/z = xyz x/(y/z) = x(yz) = xy + xz Not Associative b) x y = xy + xy = y x = yx + yx Commutative (x y) z = (1,24,7) = x (y z) Associative

Page:

You might also like