Tech Engineer - Computer Engineering - Solved Exam, Exams of Computer Science

Main points of this past exam are: Tech Engineer, Incomplete Circuits, Switch Level, Implementation Using, Design Should, Simplify the Expression, Mixed Logic, Ready Expressions, Switch-Ready, Boolean Expressions

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 Computer Engineering Spring 2000
4 problems, 4 pages Exam One Solutions 9 February 2000
1
Problem 1 (3 parts, 30 points) Incomplete Circuits
For each expression below, create a switch level implementation using N and P type switches.
Assume both inputs and their complements are available. Your design should contain no shorts
or floats. Use as few transistors as possible, but do not simplify the expression.
OUTx = DCBA +โ‹…โ‹… OUTy = EDCBA โ‹…โ‹…+โ‹… )( OUTz = CBA ++
pf3
pf4

Partial preview of the text

Download Tech Engineer - Computer Engineering - Solved Exam and more Exams Computer Science in PDF only on Docsity!

4 problems, 4 pages Exam One Solutions 9 February 2000

Problem 1 (3 parts, 30 points) Incomplete Circuits

For each expression below, create a switch level implementation using N and P type switches. Assume both inputs and their complements are available. Your design should contain no shorts or floats. Use as few transistors as possible, but do not simplify the expression.

OUTx = A โ‹… B โ‹… C + D OUTy = A โ‹… ( B + C โ‹… D )โ‹… E OUTz = A + B + C

4 problems, 4 pages Exam One Solutions 9 February 2000

Problem 2 (2 parts, 25 points) Mixed Logic

In the year 3000, a Georgia Tech engineer opens a millennium time capsule that contains a gate design using mixed logic notation. โ€œGreat use of a common sub-expression!โ€ she exclaims, โ€œBut you should have used NAND gates.โ€ Extract the two output expressions from the circuit below and then reimplement using NAND gates. Determine the transistor savings of the new design.

OUTx = A โ‹… B + C

OUTy = (^) B + C + D โ‹… E

NAND gate implementation (use correct mixed logic notation)

A

B

C

D

E

OUTx

OUTy

Transistors in original implementation 4 x 4 + 6 x 2 = 28

Transistors in NAND implementation 4 x 4 + 3 x 2 = 22

4 problems, 4 pages Exam One Solutions 9 February 2000

Part B (10 points) For the following behavior (in map format), derive a simplified sum of products expression using a Karnaugh Map. Circle and list the prime implicants, indicating which are essential. Then write the simplified SOP expression.

simplified SOP expression (^) A โ‹… B + A โ‹… D + A โ‹… B โ‹… D + A โ‹… C

Part C (10 points) For the following behavior (in map format), derive a simplified product of sums expression using a Karnaugh Map. Circle and list the prime implicants, indicating which are essential. Then write the simplified POS expression.

simplified POS expression (^) ( A + B )โ‹…( A + D )