# hw1 - Problem 4(2 pts Prove the following Boolean equations...

This preview shows pages 1–2. Sign up to view the full content.

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING ECE 2030 Fall 2005 Problem Set #1 Assigned: 30-Aug-05 Due Date: 08-Sep-05 This assignment is due at the beginning of class on Wednesday, September 8 (remem- ber, Monday is labor day). Problem 1 (2 pts): Build a truth table for the following: a. F = ( a + b ) c b. F = c + ( c + a ) b c. F = a b d. F = a ( b + c d + c f ) Problem 2 (2 pts): Draw a transistor-level schematic for the following Boolean functions. a. F = ( a + b ) c b. F = c + ( c + a ) b c. F = a b d. F = a ( b + c d + c f ) Problem 3 (2 pts): Prove DeMorgan’s Law for two inputs and for three inputs.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Problem 4 (2 pts): Prove the following Boolean equations using algebraic manipulation: a. a b + a c d + a b c d = b + a c d b. Given that AB = 0 and A + B = 1, prove BC + A B + AC = A + C Problem 5 (2 pts): For each pull-up/pull-down network below, give the Boolean expression and draw its pull-down/pull-up network. F F F a b c d’ a b’ c d f g a’ b’ c d (a) (b) (c)...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

hw1 - Problem 4(2 pts Prove the following Boolean equations...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online