maxterm expression. 2. (DeMorgan's Lev) Use DeMorgan's theorems to compute the complement of the following Boolean...

 

Transcribed Image Text:

maxterm expression. 2. (DeMorgan's Lev) Use DeMorgan's theorems to compute the complement of the following Boolean expressions (a) C(A + AD) (b) (X+Y)(W + Z) (e) V(Y+W2 + Xs) 3. (Canonical Forms and Boolean Simplification) Given the following function in product of sums form, not necessarily minimized: F(A.B,C,D) (A+C+DA+C+D) (a) Express the function in canonical sum of products form. (b) Express the function using "little m" notation. 4. (Laws and Theorems of Boolean Algebra) For the given Boolean expression prove the following, (A + B)A+C)(B+C) -(A+B) C (a) Prove that the Boolean expression is true using the truth tables. (b) Prove that the Boolean expression is true using the laws and theorems of Boolean algebra found in the text. Make sure that each step uses only one law and write the law used beside each step. 5. (Boolean Simplification) Use Karnaugh maps (K-maps) to simplify the following functions in sum of products form. In each case give the number of literals that appears in your minimized solutions. (a) F(X,Y,Z) = Π.Μ{0, 2, 4, 5) (b) F(A,B,C,D) = IIM (0,1,2,3,9,11) (c) F(A.B,C,D) * 2m(6,7.12,13,14) (d) F(A, B, C, D, E) = Em(1,4,8, 23, 24, 26, 30) maxterm expression. 2. (DeMorgan's Lev) Use DeMorgan's theorems to compute the complement of the following Boolean expressions (a) C(A + AD) (b) (X+Y)(W + Z) (e) V(Y+W2 + Xs) 3. (Canonical Forms and Boolean Simplification) Given the following function in product of sums form, not necessarily minimized: F(A.B,C,D) (A+C+DA+C+D) (a) Express the function in canonical sum of products form. (b) Express the function using "little m" notation. 4. (Laws and Theorems of Boolean Algebra) For the given Boolean expression prove the following, (A + B)A+C)(B+C) -(A+B) C (a) Prove that the Boolean expression is true using the truth tables. (b) Prove that the Boolean expression is true using the laws and theorems of Boolean algebra found in the text. Make sure that each step uses only one law and write the law used beside each step. 5. (Boolean Simplification) Use Karnaugh maps (K-maps) to simplify the following functions in sum of products form. In each case give the number of literals that appears in your minimized solutions. (a) F(X,Y,Z) = Π.Μ{0, 2, 4, 5) (b) F(A,B,C,D) = IIM (0,1,2,3,9,11) (c) F(A.B,C,D) * 2m(6,7.12,13,14) (d) F(A, B, C, D, E) = Em(1,4,8, 23, 24, 26, 30)

Answer rating: 100% (QA)

DeMorgans Law Use DeMorgans theorem to compute the complement of the following Boolean expressions a CAAD The complement of AAD is given by CAAD CACAD ... View the full answer