Exam Solutions for Computer Engineering Fall 2008 - Problem Sets 1, Exams of Computer Science

The solutions to exam one for the computer engineering course ece 2030 b offered in fall 2008. The solutions include the completion of incomplete circuits, transformation of boolean expressions for switch-level implementation, implementation of expressions using multi-input nand and nor gates, and simplification of expressions using karnaugh maps.

Typology: Exams

2012/2013

Uploaded on 04/08/2013

savitri_122
savitri_122 ๐Ÿ‡ฎ๐Ÿ‡ณ

4.6

(14)

184 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 B 1:00pm Computer Engineering Fall 2008
4 problems, 5 pages Exam One Solutions 15 September 2008
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
๎‚ƒ
B
๎‚ƒ๎‚—
C
๎‚Ÿยฐ๎‚žD๎‚ƒ๎‚—
E
๎‚Ÿ
OUTy = ๎‚ž๎‚—
A๎‚ƒ
B
ยฐ๎‚—
D๎‚Ÿยฐ
C
OUTz =
C
1
Out
x
Out
z
A
B
C
A B
DE
C
A
B
C
D
E
Out
y
A
B
C
D
C
A
B
D
C
pf3
pf4

Partial preview of the text

Download Exam Solutions for Computer Engineering Fall 2008 - Problem Sets 1 and more Exams Computer Science in PDF only on Docsity!

4 problems, 5 pages Exam One Solutions 15 September 2008

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 ๎‚ƒ B ๎‚ƒ ๎‚— C^ ๎‚Ÿยฐ๎‚ž^ D ๎‚ƒ ๎‚— E^ ๎‚Ÿ

OUTy = ๎‚ž ๎‚— A ๎‚ƒ B^ ยฐ ๎‚— D ๎‚Ÿยฐ C

OUTz = C

Outx

Outz

A

B

C

A B

D E

C

A

B

C

D

E

Outy A

B

C

D

C

A

B

D

C

4 problems, 5 pages Exam One Solutions 15 September 2008

Problem 2 (1 part, 18 points) Switch-Ready Expressions

Transform each of the following Boolean expressions to a form where they are ready for switch level implementation (i.e., there should only be bars over input variables, not over operations). The behavior of the expression should remain unchanged. Do not implement.

Out (^) X = A โ‹… B + C + D ๎‚ž๎‚ž ๎‚— A ๎‚ƒ B ๎‚Ÿยฐ ๎‚— C ๎‚Ÿ๎‚ƒ ๎‚— D =๎‚ž ๎‚— A ๎‚ƒ B ๎‚Ÿยฐ ๎‚— C ๎‚ƒ ๎‚— D

OutY = A + B + C โ‹… D ๎‚ž ๎‚— A ยฐ^ B^ ๎‚Ÿ๎‚ƒ๎‚ž C ๎‚ƒ ๎‚— D ๎‚Ÿ= ๎‚— A ยฐ^ B ๎‚ƒ C ๎‚ƒ ๎‚— D

Out (^) Z = A โ‹… B + C ๎‚— A^ ยฐ^ B ยฐ C

Problem 3 (3 parts, 28 points) Mixed Logic Design

Part A (10 points) Implement the following expression using multi-input NAND gates and inverters to minimize total transistors (switches) required. Use proper mixed logic design technique. Do not simplify the expression.

OUT (^) X = A + B + C +( D + E )โ‹… F

switches =^22

A

B

D

E

C OUT X

F

4 problems, 5 pages Exam One Solutions 15 September 2008

Problem 4 (2 parts, 24 points) Karnaugh Maps

Part A (12 points) For the follow expression, derive a simplified sum of products expression using a Karnaugh Map. Circle and list the prime implicants, indicating which are essential.

Out =( A + D )โ‹…( A + B + C )โ‹…( A + B + C + D )

simplified SOP expression ๎‚— B^ D ๎‚ƒ ๎‚— C^ D ๎‚ƒ A^ D ๎‚— Part B (12 points) For the follow expression, derive a simplified product of sums expression using a Karnaugh Map. Circle and list the prime implicants, indicating which are essential.

Out = C โ‹… D + A โ‹… B โ‹… C + B โ‹… C โ‹… D

simplified POS expression ๎‚ž^ B ๎‚ƒ ๎‚— C^ ๎‚Ÿยฐ๎‚ž ๎‚— A ๎‚ƒ ๎‚— D ๎‚Ÿยฐ๎‚ž ๎‚— D ๎‚ƒ C^ ๎‚Ÿ

A

A

B B

C

C

C

D

D D

prime implicants

essential? yes no

AB

C D

B D

A D

A C

A

A

B B

C

C

C

D

D D

prime implicants

essential? yes no

C + D

A + D

B+ C

B + D