fa10-lw-s1 - ECE 2030 C 2:00 pm 4 problems, 4 pages...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 2030 C 2:00 pm Computer Engineering Fall 2010 4 problems, 4 pages Exam One Solutions 22 September 2010 Problem 1 (3 parts, 30 points) Incomplete Circuits The three parts below contain (A) a pull up network, (B) a pull down network, and (C) an expression to be implemented. For (A) and (B), complete the missing complementary switching networks so the circuit contains no floats or shorts and write the Boolean expression computed by the completed circuit. For (C), design the entire switching network. Assume the inputs and their complements are available. OUTx = A B C ⋅ D OUTy = A B C D E OUTz = A B ⋅ D C ⋅ E F 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
ECE 2030 C 2:00 pm Computer Engineering Fall 2010 4 problems, 4 pages Exam One Solutions 22 September 2010 Problem 2 (2 parts, 20 points) Boolean Algebra Part A (12 points) Transform each of the following Boolean expressions to a form where they are ready for switch level implementation (i.e., there should only be bars over input variables, not
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/26/2011 for the course ECE 2030 taught by Professor Wolf during the Spring '07 term at Georgia Tech.

Page1 / 4

fa10-lw-s1 - ECE 2030 C 2:00 pm 4 problems, 4 pages...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online