Chapter 5.4, Problem 1CU

@ Prove hat (X+Y2(X+Z)=X+YZ using Rules of Boolean algebra ?

Implement the expression X = (A + B + C)DE by using NAND logic.

10 The simplified Boolean function in SoP, which is obtained from F (A,B, C) = N (2, 3, 4, 5, 6, 7) is: O AB + A'B' O A'B'C' O A'B' O AB O None

Implement the following function using NOR gate only: a) F (A,B,C,D) = [I (0,4,8,12), d (1,2,3) b) Y (D,C,B,A) = E (2,3,5,6,7), d (8,9)

Use the laws of Boolean algebra to simplify the following Boolean expressions : (a) yx[x+(x*xy)] (b) [(rx y')+ xJ

Construct the truth table and implement the equivalent logic circuit of (A V B) AC wm m w m m w w v m w m w w w w d w A В C F

Simplify the expressions using Boolean algebra Y = (A + B)(Ā + C)(B + C)

Q1: Let F1 =x.Y F2 = A OB , F3 = F1 + F2 %3D Implement the above Boolean expression with logic circuit giving the truth table.

Design a code converter that converts a decimal digit from Gray Code to BCD code. Show the following: a. Truth table b. Simplified Boolean function of the output variables using map method. Logic Diagram using XOR/XNOR implementation if possible C.