ELEN333: Introduction to Digital Design Homework #2: Due in PDF format on Moodle by due date....

Transcribed Image Text:

ELEN333: Introduction to Digital Design Homework #2: Due in PDF format on Moodle by due date. 1.) Write a Boolean equation in sum-of-products canonical form for each of the truth tables: (b) (c) (d) (a) A 0 B Y 0 1 1 1 1 a. b. C. A B C 0 0 0 0 0 0 0 1 0 1 1 0 0 0 1 1 0 1 1 00 0 1 1 0 1 1 00 0 1 1 0 1 1 2.) Write a Boolean equation in product-of-sums canonical form for each of the above truth tables. 0 1 1 1 OHO A B C 0 0 0 0 0 0 1 1 1 1 0 1 1 0 Y 0 1 1 0 1 0 1 1 1 0 1 0 1 1 1 A B 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 1 1 1 1 0 1 1 0 Y 0 1 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 (e) D Y A B C D 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 0 0 1 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1 implementing each of the functions from question 3 using only NOT, AND, and OR gates (use PLA style). Y 0 0 0 5.) Simplify the following Boolean equations using Boolean theorems. Check for correctness using a truth table. 1 0 0 1 1 1 1 1 3.) Minimize each of the Boolean equations from question 1. 4.) Sketch a reasonably simple combinational circuit 1 0 0 0 0 6.) Sketch a reasonably simple combinational circuit for each of the functions from question 5 using only NOT, AND, and OR gates (use PLA style). ELEN333: Introduction to Digital Design Homework #2: Due in PDF format on Moodle by due date. 1.) Write a Boolean equation in sum-of-products canonical form for each of the truth tables: (b) (c) (d) (a) A 0 B Y 0 1 1 1 1 a. b. C. A B C 0 0 0 0 0 0 0 1 0 1 1 0 0 0 1 1 0 1 1 00 0 1 1 0 1 1 00 0 1 1 0 1 1 2.) Write a Boolean equation in product-of-sums canonical form for each of the above truth tables. 0 1 1 1 OHO A B C 0 0 0 0 0 0 1 1 1 1 0 1 1 0 Y 0 1 1 0 1 0 1 1 1 0 1 0 1 1 1 A B 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 1 1 1 1 0 1 1 0 Y 0 1 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 (e) D Y A B C D 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 0 0 1 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1 implementing each of the functions from question 3 using only NOT, AND, and OR gates (use PLA style). Y 0 0 0 5.) Simplify the following Boolean equations using Boolean theorems. Check for correctness using a truth table. 1 0 0 1 1 1 1 1 3.) Minimize each of the Boolean equations from question 1. 4.) Sketch a reasonably simple combinational circuit 1 0 0 0 0 6.) Sketch a reasonably simple combinational circuit for each of the functions from question 5 using only NOT, AND, and OR gates (use PLA style).