ECE 2030 Spring 2002 Exam One: Computer Engineering, Exams of Computer Science

The instructions and problems for an exam in computer engineering, specifically ece 2030, held in spring 2002. The exam consists of 4 problems, each with multiple parts, and spans 5 pages. Instructions for the exam, such as it being closed book and closed note, as well as the specific problems which require students to design switch level implementations, reengineer gate designs, and work with priority encoders and decoders using karnaugh maps.

Typology: Exams

2012/2013

Uploaded on 04/08/2013

selvi_pr43
selvi_pr43 ๐Ÿ‡ฎ๐Ÿ‡ณ

4.7

(3)

66 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 1:00pm Computer Engineering Spring 2002
4 problems, 5 pages Exam One 6 February 2002
1
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have
a question, raise your hand and I will come to you. Please work the exam in pencil and do not
separate the pages of the exam. For maximum credit, show your work.
Good Luck!
Your Name (please print) ________________________________________________
1234 total
27 27 20 26 100
pf3
pf4
pf5

Partial preview of the text

Download ECE 2030 Spring 2002 Exam One: Computer Engineering and more Exams Computer Science in PDF only on Docsity!

4 problems, 5 pages Exam One 6 February 2002

Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate the pages of the exam. For maximum credit, show your work. Good Luck!

Your Name ( please print ) ________________________________________________

1 2 3 4 total

4 problems, 5 pages Exam One 6 February 2002

Problem 1 (3 parts, 27 points) Switch Design

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.

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

4 problems, 5 pages Exam One 6 February 2002

Problem 3 (2 parts, 20 points) Playing with Blocks

Part A (10 points) Consider a priority encoder with the following behavior:

In3 In 2 In1 In0 O 1 O 0 Valid 0 0 0 0 X X 0 X X X 1 0 0 1 0 X 1 0 0 1 1 0 1 0 0 1 0 1 1 X X 0 1 1 1

List the inputs (In 0 , In1 , In2 , and In 3 ) in increasing priority.

lowest priority 3 rd^ highest priority 2 nd^ highest priority highest priority

Part B (10 points) Consider the following circuit. For each combination of inputs listed below, describe the corresponding outputs.

4 to 2

priority

encoder

In 0

In 1

In^2

In (^3) In 3 > In 2 > In 1 > In 0

Out 0

Out 1

V

A

B

C

D

2 to 4

decoder

In 0

In 1

En

Out 0

Out 1

Out 2

Out 3

W

X

Y

Z

oops!

A B C D W X Y Z

4 problems, 5 pages Exam One 6 February 2002

Problem 4 (2 parts, 26 points) Karnaugh Maps

Part A (13 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 โ‹… B โ‹… D + A โ‹… B โ‹… C + B โ‹… C โ‹… D + A โ‹… C โ‹… D + A โ‹… B โ‹… D

A

A

B B

C

C

C

D

D D

prime implicants

essential? yes no

simplified SOP expression Part B (13 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 =( A + C + D )โ‹…( A + B + C )โ‹…( A + C + D )โ‹…( A + B + C + D )

A

A

B B

C

C

C

D

D D

prime implicants

essential? yes no

simplified POS expression