fa07-sw-s1 - ECE 2030 A 10:00am 4 problems, 4 pages Problem...

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

View Full Document Right Arrow Icon
ECE 2030 A 10:00am Computer Engineering Fall 2007 4 problems, 4 pages Exam One Solutions 19 September 2007 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. OUTx = A C ⋅ E OUTy = A B C D E F OUTz = A 1 Out x B C A E D A C E Out z A A Out y A D F B E C A B C D E F
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 A 10:00am Computer Engineering Fall 2007 4 problems, 4 pages Exam One Solutions 19 September 2007 Problem 2 (2 parts, 26 points) Mixed Logic Reengineering Part A (10 points) Write the output expressions for the gate design shown above. Also determine the number of switches used in its implementation. OUT X = A ⋅ A B ⋅ C D E OUT Y = C D E  D E F # switches = 1 × 6 + 5 × 4 + 6 × 2 = 6 + 20 + 12 = 38
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 06/17/2008 for the course ECE 2030 taught by Professor Wolf during the Fall '07 term at Georgia Institute of Technology.

Page1 / 4

fa07-sw-s1 - ECE 2030 A 10:00am 4 problems, 4 pages Problem...

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