100111000 AB CD 10100

1 11

0 00011110 0

The t wo pairs c ells c onnec t e by arrows c an arbit rarily l s o long as on end of an arro pw oints to a 1 and the other end t o a 0 . Tw o possible minimal sum-of-products

expressions are: f = AB + BD + BC + ACDf = CD +

D + BD + A

BC 4.13.
11111111100 T = yz + wz + xy 1 11 0 0

00011110 wx yz 11Essential prime implicantsand unique minimum cover.11111111100 1 11 0 00011110 0 wx yz 11Nonessential primeimplicants.

4.14. ( a ) Essential prime implicants:

{
w

xy

, w x y , w x

}
Non-essential prime implicants:

{
w

z,x

}
( b ) T = w

xy

+ wxy + wx

{
any two of ( w

z,x

z )

}
.

4.15. ( a )( i )

(5 , 6 ,

7 , 9 , 10 , 11 , 13 , 14)( ii )


(0 , 3 , 5 , 6 , 9 ,

10 , 12 , 15)( b ) (i)

(5 , 6

, 7 , 9 , 10 , 11 , 12 , 13 ,

14)( ii )

(5 , 6 , 7 , 9

, 10 , 11 , 13 , 14 ,
15)