This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 4. Divide the following binary numbers using the method shown in class. a) 10010 / 1110 b) 1011100 / 11011 5. Prove the following Boolean equation using axioms/theorems of Boolean algebra; list what axiom you used. a) X + (X + Y’)’ = X + Y b) XY + Y’Z = (X + Y’) (X + Z) (Y + Z) 6. Draw the schematic of the following function using NAND gates only XY + XZ’ 7. What is the Boolean function of the following circuit? A, B and C are inputs and Z is the output 8. Show the necessary changes in the wiring of the circuit of Problem 7 in order to change its function to Z = ((A + B) C)’. (No additional transistors can be added) 9. Draw the transistor level diagram of a circuit realizing the following function. Argue why your design is efficient in terms of number of transistors that are used. F(A, B, C, D) = ((AB + C) D)’...
View
Full
Document
This note was uploaded on 04/15/2010 for the course CSE CSE140 taught by Professor Rosing during the Winter '10 term at UCSD.
 Winter '10
 Rosing

Click to edit the document details