A f c a ab a b f ab c d bc c f

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

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

Unformatted text preview: stor-level schematic for the following Boolean functions. (a) F = (¯ + ¯)c + a ab ¯a (b) F = a(b + c + d)(¯ + bc) ¯ (c) F = a(¯ + b) + ad + bcd c ¯ (d) F = b(ab + e¯(a + cd)) + ab ¯b ¯ 2. Consider the following Boolean function: F = a + a(¯ + b)(b + c). ¯ c ¯ (a) build the truth table for the pull-up network. (b) build the truth table for the pull-down network. (c) build the truth table for F . 3. For each pull-up/pull-down network below, give the Boolean expression and draw its pull-down/pull-up network. F c a a’ a’ b’ e b b’ e a d’ c a b’ F d a’ F (a) (b) (c) F b’ e a d’ c a’ (d)...
View Full Document

This note was uploaded on 07/07/2013 for the course ECE 2020 taught by Professor Mooney during the Summer '13 term at Georgia Tech.

Ask a homework question - tutors are online