fa03-lw-s1 - ECE 2030G 4 problems, 5 pages Problem 1 (2...

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

View Full Document Right Arrow Icon
ECE 2030G Computer Engineering Fall 2003 4 problems, 5 pages Exam One Solutions 18 September 2003 1 Problem 1 (2 parts, 20 points) Switch-level Design Part A (8 points) Transform each of the following Boolean expressions to a form where they can be implemented using switches (i.e., there should be no bars in the expression except for complements of the inputs A, B, C, etc.). The behavior of the expression should remain unchanged. ) ) ( ) ) ) (((( H F E D C B A Out X + + + + = H F E D C B A Out X + + + = ) ( ) ) ) ((( ) ) ) ) (((( E D C B A Out Y + + = E D C B A Out Y + + = ) ) ) ((( Part B (12 points) Two incomplete circuits are shown below. Complete each circuit by adding the needed switching network so the output is pulled high or low for all combinations of inputs (i.e., no floats or shorts). Then write the expression. Assume both the inputs and their compliments are available. Out y A D C B A Out x C E D C D E A D C B E D C OUT X + = D C B A OUT Y + =
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 2030G Computer Engineering Fall 2003 4 problems, 5 pages Exam One Solutions 18 September 2003 2
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 08/23/2010 for the course EE 2030 taught by Professor Wills during the Spring '10 term at Georgia Institute of Technology.

Page1 / 4

fa03-lw-s1 - ECE 2030G 4 problems, 5 pages Problem 1 (2...

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