Problems1-4SimplifyeachBooleanexpressiontooneof.docVIP

Name: Problems 1-4: Simplify each Boolean expression to one of the following ten expressions: 0, 1, A, B, AB, A+B, , +, A, B Each answer may be used as many times as necessary. 1. A(A+)+B = AA+A+B by the distributive law = A+0+B because AA = A and A= 0 = A+B because A + 0 = A 2. (A+B)(+B)= (A+B)(+B) by the distributive law = (A+B)(+0) because B= 0 = (A+B)() because +0 = = A+B by the distributive law = A0 +0 because A= 0 and B= 0 = 0 because 0 ANDed with anything is 0 3. 0 because 0 ANDed with anything is 0 The trick is not to bother to simplify the terms in parentheses. 4. DeMorgans Theorem is needed. I prefer the graphical form. First, I draw the gate representing the original expression (NOR receiving NOT A and NOT B): DeMorgans Theorem says I can swap shapes (OR to AND) if I invert all inputs and outputs: So . Problems 5-8: Write any valid Boolean expression for Q as a function of the input variables. 5. Q = +B 6. 7. 8. Problems 9-10: Complete the truth tables. 9. Two points. A Q 0 ___1__ 1 ___0__ The safest thing to do is to consider each case (0 and 1) separately, plugging in each possible value for A. This way, if you make a mistake, you dont cause both your answers to be wrong. Then, if you have time, you can reason as follows to confirm your answers. The AND receives A and NOT A, which can never be 1 at the same time, so the AND output is always 0. So the NOR outputs 1 when A is 0 and 0 when A is 1. 10. Four points. A B Q 0 0 __0___ 0 1 __0___ 1 0 __1___ 1 1 __0___ Again, the safest thing to do is to plug in each of the four combinations of A and B. Then you could confirm your results with the following reasoning: Q can only be 1 if both inputs to the final NOR are 0. So (for Q to be 1) B must be 0, and in order for the first NOR to output 0, A must then be 1. So Q is 1 if A = 1 and B = 0; otherwise, Q = 0.11. Show how to make a 2-input NAND out of 2-input NORs. I start with what I want, a NA