15. Using the Truth Tables below, demonstrate that the Boolean Expression (on the left) is equal...

Transcribed Image Text:

15. Using the Truth Tables below, demonstrate that the Boolean Expression (on the left) is equal to the Boolean Expression (on the right). 6pts. A+AB=A+B A 0 0 1 1 B 0 1 0 1 A AB 16. Convert the Truth Table (to the right) into a Boolean Expression in the Sum of Products form. 3pts. 17. Convert the Truth Table (to the right) into a Boolean Expression in the Sum of Products form. 3pts. A 0 0 T A 0 0 0. 0 T A+AB B 0 0 0 B 0 T 0 C 0 0 0 0 OUT 0 T 0 0 0 0 A 0 0 1 1 B 0 1 0 1 Sum of Products Form Sum of Products Form A+B 18. Minimize (i.c. simplify) the Boolean Expression to two 3-input gates and one 2 input gate. Write down the number of the Theorem that allows you to take each step in the minimization process. 8pts. X ACD + ABCD Theorem Number or Name 19. Minimize the Boolean Expression to one simple 2-input gate. Write down the number of the Theorem that allows you to take each step in the minimization process. 8pts. Y (A + AB) (A + B) + AB Theorem Number or Name 20. Use a Karnaugh Map to reduce the following expression. 8pts. Y=ABC + ABC + ABC AB 00 AB 01 AB 11 AB 10 Reduced equation: Y = AB 00 AB 01 AB 11 AB 10 C1 21. Use a Karnaugh Map to reduce the following expression. It may help to multiply out terms to create a simpler SOP before filling in the Karnaugh Map. Or not. 10pts. X=A(CD + CD) + ABD + BCD CD 00 CD 01 CD 11 Fall 2023-24 CD 10 Reduced equation: X= 22. Draw the combinational logic circuit for the reduced equation found in question 21. 6pts. 15. Using the Truth Tables below, demonstrate that the Boolean Expression (on the left) is equal to the Boolean Expression (on the right). 6pts. A+AB=A+B A 0 0 1 1 B 0 1 0 1 A AB 16. Convert the Truth Table (to the right) into a Boolean Expression in the Sum of Products form. 3pts. 17. Convert the Truth Table (to the right) into a Boolean Expression in the Sum of Products form. 3pts. A 0 0 T A 0 0 0. 0 T A+AB B 0 0 0 B 0 T 0 C 0 0 0 0 OUT 0 T 0 0 0 0 A 0 0 1 1 B 0 1 0 1 Sum of Products Form Sum of Products Form A+B 18. Minimize (i.c. simplify) the Boolean Expression to two 3-input gates and one 2 input gate. Write down the number of the Theorem that allows you to take each step in the minimization process. 8pts. X ACD + ABCD Theorem Number or Name 19. Minimize the Boolean Expression to one simple 2-input gate. Write down the number of the Theorem that allows you to take each step in the minimization process. 8pts. Y (A + AB) (A + B) + AB Theorem Number or Name 20. Use a Karnaugh Map to reduce the following expression. 8pts. Y=ABC + ABC + ABC AB 00 AB 01 AB 11 AB 10 Reduced equation: Y = AB 00 AB 01 AB 11 AB 10 C1 21. Use a Karnaugh Map to reduce the following expression. It may help to multiply out terms to create a simpler SOP before filling in the Karnaugh Map. Or not. 10pts. X=A(CD + CD) + ABD + BCD CD 00 CD 01 CD 11 Fall 2023-24 CD 10 Reduced equation: X= 22. Draw the combinational logic circuit for the reduced equation found in question 21. 6pts.

Answer rating: 100% (QA)

20 To reduce the expression Y ABC ABC ABC using a Karnaugh Map we can follow these steps 1 Create th... View the full answer