This preview shows pages 1–3. Sign up to view the full content.
ECE 2030 A 11:00am
Computer Engineering
Spring 2011
4 problems, 4 pages
Exam One Solutions
9 February 2011
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
⋅
D
E
OutY =
A
⋅
B
D
⋅
C
E
OutZ =
A
B
⋅
C
D
⋅
E
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document ECE 2030 A 11:00am
Computer Engineering
Spring 2011
4 problems, 4 pages
Exam One Solutions
9 February 2011
Problem 2 (2 parts, 20 points)
Boolean Algebra
Part A (12 points) Transform each of the following Boolean expressions to a equivalent form
where
they contain only AND operations
.
Do not implement
.
OUT
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 Institute of Technology.
 Spring '07
 WOLF

Click to edit the document details