EE2022 B Term 2000
Homework - 3 (due start of class Monday November 20th)
Show all work. No credit given if the work is not shown.
(a) F = A.B + A.B.C’.D + A.B.D.E’ + A.B.C’.E + C’.D.E
(b) F = M.N.O + Q’.P’.N’ + P.R.M + Q’O.M.P’ + M.R
(a) F = A.B. + A.B’.C’ + A’.B.C
(b) F = (A + A’).B + B.A.C’ + C.(A+B’).(A’+B)
(a) F =
S x,y(1,2)(b) F =
P A,B(0,1,2)(c) F =
S A,B,C(2,4,6,7)(d) F =
P W,X,Y(0,1,3,4,5)(e) F = V’ + (W’.X’)’
(a) F =
S x,y,Z(1,3,5,6,7)(b) F =
S w,x,y,Z(1,4,5,6,7,9,14,15)(c) F =
P w,x,y(0,1,3,4,5)(d) F =
S w,x,y,Z(0,2,5,7,8,10,13,15)(e) F =
P A,B,c,D(0,1,7,9,13,15)
(a) Write the algebraic expression for the function F in terms of the variables A, B, and C.
(b) Write the canonical sum and canonical product of the function F
(c) By algebraic manipulation minimize the circuit in sum of products form and implement the circuit with logic gates.
(d) Redesign the circuit from part (C) but this time use ONLY two-input NAND gates to implement the design.
(e) For the original circuit use a Karnaugh map to produce a simplified implementation.