Unformatted text preview: terms of the inputs A, B, and C from the given truth table. The more optimized the final expression is, the more credit you will get. A B C X Y 0 0 0 0 0 0 0 1 1 0 0 1 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 5. Problem 5: Create a 4bit number detector with NAND and NOT only. The circuit has four inputs N3,N2,N1 and N0 that correspond to a 4bit unsigned number (N3 is the most significant bit) and one output named P that outputs a 1 when the input is greater than zero and is a multiple of 3 or 4. Otherwise, it outputs 0. 6. Problem 6: Design a circuit that turns on or off a hall light based on the configuration of three control switches. If at least two of the control switches are on at the same time, the light is off. If all the control switches are off, the light is off. Otherwise, the light is on. Start with a truth table. Use NOR and NOT only. ec311hw02 9/11/2009...
View
Full Document
 Fall '09
 Karpovsky
 Boolean Algebra, Boolean function, Booleanvalued function, following Boolean functions

Click to edit the document details