Question: (figures and tables may be hand drawn), show all work. For simplifications, you do not need to write any of the identities you applied

(figures and tables may be hand drawn), show all work. For simplifications, 

(figures and tables may be hand drawn), show all work. For simplifications, you do not need to write any of the identities you applied but you do need to show your work step-by-step. The 7 questions are each worth 14 points, problems with multiple parts (e.g., 1a, 1b) are equally weighted (e.g., la is worth 7 points, 2b is worth 7 points, etc). 1) Construct a truth table for each of the following Boolean expressions. a. F(xy)2+x b. G (w+yz)+w*y+x*z 2) Simplify the following Boolean statements. You do not need to specify which identities you are using. a. xyz+x*y*z+y*z b. x+y+z+y+z 3) Fxy+z, G = y + z; show (and reduce) each of F, G, FG, FG, and F+ G. When done, you should have F G = F + G to prove that DeMorgan's Law holds for F and G. Note: you will need to apply DeMorgan's Law in doing your reductions. 4) Prove the following two expressions are equal by a. showing both sides have the same truth table results and b. simplifying the left hand side into the right hand side w*x*y+w*z+x+y+y+z=w*z+y 5) Draw the circuits for the expressions (unsimplified) from question number 1.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!