2 CE103 Digital Cireuits By Kin Tak U Chapter 2 Part 2 33 Assignment 4 2-14 Optimize the following Boolean functions by means of a three-variable map (a) F(X, Y, Z) = na( 0, 2, 6, 7) (C) F(A, B, C)=>m, 0,2,4, 6) (b)F(XVZ) =11 0, 1.2.4i (d)RA,B, C) =:n( 0,2. 3.4.5.7) 2-15 Optimize the following Boolean expressions using a map: (a) X.Z+YZ+ XYZ (b) AB + BC+ A B.C (c) A. B+ AC+ BC+ ABC 2-18 Find the minterms of the following expressions by first plotting each expression on a map: (c) BD + ABD +ABC Due date: DI:(2015-02-04), D2:(2015-02-05) during the class CE103 Digital Circuits 36 By Kin Tak U Chapter 2- Part 2