fa03-sw-e1c

fa03-sw-e1c - ECE 2030 C 11:00pm 4 problems, 5 pages...

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

View Full Document Right Arrow Icon
ECE 2030 C 11:00pm Computer Engineering Fall 2003 4 problems, 5 pages Exam One Solutions 17 September 2003 1 Problem 1 (3 parts, 30 points) Incomplete Circuits For each partial switch circuit below, complete the complementary switching network so the circuit contains no floats or short. Also write the Boolean expression computed by the completed circuit. Assume the inputs and their complements are available. F B C Out x E A Out z A B C D A D B Out y E C OUTx = OUTy = OUTz =
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 11:00pm Computer Engineering Fall 2003 4 problems, 5 pages Exam One Solutions 17 September 2003 2 Problem 2 (2 parts, 24 points) Mixed Logic Reengineering A B C E F OUTx OUTy D G Part A (12 points) Write the output expression for the gate design shown above. Also determine the number of switches used in its implementation. OUTx = OUTy = # switches = Part B (12 points) Reimplement the behavior below with a mixed logic design style using only AND gates and inverters. Determine the number of switches used in this implementation.
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.

Page1 / 4

fa03-sw-e1c - ECE 2030 C 11:00pm 4 problems, 5 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