hw1 - AB C + B C D + BC + C D = B + C D (b) WY + W Y Z +...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 1 EECS 203 Due 10 Apr 2009 Please keep track of how long you spend doing this homework assignment. Specifically, how much time is needed to do the problems after studying enough to understand the concepts? 1. Do and self-check Mano 2-1, 2-2, and 2-9 (don’t hand in). If this is difficult, see me or a TA. 2. (10 pts.) Prove that any function f : B m B n can be implemented with only two-input NAND gates and constant 1. 3. (10 pts.) Mano 2-8 Using DeMorgan’s Theorem, express the function F = ABC + B C + A B with only OR and complement operations with only AND and complement operations 4. (10 pts.) Mano 2-3 Prove the identity of the following Boolean equation using algebraic manipulation: (a)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: AB C + B C D + BC + C D = B + C D (b) WY + W Y Z + WXZ + W X Y = WY + W X Z + X Y Z + X Y Z (c) A D + AB + C D + BC = ( A + B + C + D )( A + B + C + D ) 5. (10 pts.) Mano 2-4 Suppose that A · B = 0 and A + B = 1. Use algebraic manipulation to prove that ( A + C ) · ( A + B ) · ( B + C ) = B · C 6. (10 pts.) Find a minimum literal count Boolean formula for a function with the following truth table. a b c d f(a, b, c, d) 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 7. How much time did you spend on this assignment? 1...
View Full Document

This note was uploaded on 01/12/2011 for the course EECS 203 taught by Professor Wu during the Winter '08 term at Northwestern.

Ask a homework question - tutors are online