This preview shows pages 1–3. Sign up to view the full content.
ECE 2030 E 1:00pm
Computer Engineering
Spring 2003
4 problems, 4 pages
Exam One
5 February 2003
Problem 1 (3 parts, 27 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.
A
B
C
Out
x
E
A
B
C
E
D
D
A
D
B
Out
y
E
C
F
A
E
D
F
Out
z
A
B
D
C
E
E
D
C
A
B
OUTx =
D
E
C
B
A
⋅
+
+
⋅
)
(
OUTy =
)
(
)
(
F
D
E
A
+
⋅
+
OUTz =
E
D
C
B
A
⋅
+
+
⋅
)
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentECE 2030 E 1:00pm
Computer Engineering
Spring 2003
4 problems, 4 pages
Exam One
5 February 2003
Probl
em 2 (3 parts, 29 points)
Mixed Logic Reengineering
A
B
C
E
F
OUTx
OUTy
OUTz
D
Part A (9 points) Write the output expression for the gate design shown above. Also determine
the number of switches used in its implementation.
OUTx =
B
A
+
OUTy =
E
D
C
B
A
⋅
+
+
+
OUTz =
F
E
D
+
⋅
# switches =
3 * 6 + 1 * 8 + 4 * 2 = 34 switches
Part B (10 points) Reimplement the behavior below with a mixed logic design style using only
NOR gates and inverters. Determine the number of switches used in this implementation.
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '10
 Wills

Click to edit the document details