This preview has intentionally blurred sections. Sign up to view the full version.View Full 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
- Fall '07
- Boolean Algebra, English-language films, Boolean function, Logical connective