Hi

these Questions I couldnt solve , could you help me please :

Show transcribed image text 1 – Using Boolean Algebra, simplify the following expressions as much as possible. a) F(W,X,Y,Z) = WXYZ ( WXYZ’ + WX’YZ + W’XYZ + WXY’Z) b)F(A,B,CD,E) = AB + ABC’D + ABDE’ + A’BC’E + A’B’C’E c) F (A,B,C,D) = (A’ + C)(A’ + C’)(A + B + C’D) d) F(A,B,C,D) = AC’ + AB’D + A’B’C + A’CD’ + B’C’D’ + B’CD 2- Obtain the truth table of the following functions without simplifying them. Express each function as a canonical SOP and POS (use the summation and pi notations). Draw the two-level AND-OR (or OR-AND) circuit that directly implements each function, then find the NAND-NAND implementation. a) F = (XY + z)(Y + xz) b) F = (A’ + B)(B’ + C) c) F = y’Z + wxy’ + w’x’z 3- Find the complement (F’) and the dual (F^D) of the following expressions: a)F = XY’ + x’y b) F= (AB’ + C)D’ c) F = (X + Y’ + z)(x’ + z’)(x + y) d) F = x(y’Z’ + Yz)

"Get 15% discount on your first 3 orders with us"
Use the following coupon
"FIRST15"

Order Now