1:22 Homework2 S24_64688b88db19e... 1 of 4 Homework #2 - DeMorgan's/Boolean Algebra K-maps Name Please attempt all problems below. Half of your grade for this assignment will be based on completion of all problems, the other half of the grade will be based on your score on 2 randomly selected problems. Done 1. Simplify the following Sum-of-Products Boolean expression using the provided Venn Diagram. You can confirm you work with a Karnaugh map, but the Venn Diagram shading and final answer will be the items graded. F = ABC + ABC + ABC A B с F = 2. Draw a circuit for the following Boolean Expressions using only Universal Gates (NAND/NOR). (Hint: Q

use the picture provided, where we filled out the truth table for the 2-bit adder. We also wrote out a logical expression for the s0 bit, following a sum of products approach. For the s1 bit of the new circuit, follow the same procedure and write out the logical expression.

13. For the following Boolean equation, X = A+B(A+ CB + DĀC) + AB CD %3D a) Write out the logic for the unsimplified equation. b) Simplify the equation. c) Write out the ladder logic for the simplified equation.

For the following question, you need to create a truth table, write the Boolean expression for each output based on the truth table, use K-map to simplify the expression if possible, and draw the logic diagram using AND, OR, NOT gate only. 1. Design a 3-bit shifter. a. A0, A1, A2, and S as inputs b. If S=0, then shift one bit to the left and add 0 to the last bit c. If S=1, then shift one bit to the right and add 0 to the first bit d. Y0, Y1, and Y2 as outputs