For each Boolean Algebraic Expression below: • • First, simplify the following expressions using the rules (tricks) we derived in class such as De Morgan's theorems. SHOW ALL YOUR STEPS! Second, test your solution: о Using the question's initial algebraic expression, draw a symbolic logic circuit diagram (AND, OR, Inverter gates) with an accompanying truth table: Example truth table for: A + B AB out 00 0 01 1 10 1 11 1 о 1. A(A+B) 2. Now, using your simplified solution of the algebraic expression, draw a symbolic logic circuit diagram (AND, OR, Inverter gates) with an accompanying truth table. The truth tables should be the same! ABC + ABC + ABC 3. AB ABC + A 4. AB + (A+B)C + AB 5. ABC + (A+B+C) + ABCD 6. (BBC)(B+BC) (B + D)

Write the Boolean equation for the circuit below (no need to minimize: give the exact equation implemented in the circuit)

4. Draw a logic circuit for (A+ B)'(C + D)C'.

1. Write Boolean equations for the circuit shown below. They do not need to be optimized. A B D X Y Z

Simplify the expression using deMorgan's Theorem and draw the logic circuit for the simplified expressions.

Urgent

5. Find the Boolean expression for the following circuit, and simplify it. SHOW YOUR WORK. A В

( w' + x' + y + z' )( w' + x' + y + z ). Draw the circuits before and after Simplify the expression simplification. Solution:

A) The path is not a circuit.B) The path is a circuit, but not an Euler circuit.C) The path is an Euler circuit.