He asked us to do the circuit diagrams on Digital https://github.com/hneemann/Digital

1) Given the Boolean function F-x- y+2 + x-y+2 + x-y+2 a. List the truth table for the function b. Draw the logic diagram using the original Boolean expression. (Use Digital) C. Simplify the algebraic expression using Boolean algebra d. List the truth table of the function from the simplified expression and show that it is the same as the truth table in part (a) e. Draw the logic diagram from the simplified expression and compare the total number of gates with the diagram of part (b). (Use Circuit Maker) 2) With the following circuit: a. Find the algebraic function for the circuit b. Reduce it down to at most two gates by using a K-Map c. Prove that a and b are requivalent d. Draw the new circuit in Digital. 3) Simplify the following Boolean functions using three-variable maps a. FIA,B,C) 2(0,2,3,4,6) 4) With the following Boolean function with the don't-care conditions d F(w, x, y, z)-2(0, 1, 2, 3, 7, 8, 10) d(w, x, y, z)- 2(5, 6, 11, 15) a. Build a truth table b. Write the non reduced algebraic function for F c. Reduce using a K-Map d. Draw the circuit for F found in c