Most Positive - Computer Engineering - Exam, Exams of Computer Science

Main points of this past exam are: Most Positive, Numbers of Reason, Computer Engineering, Decimal Notation, Hexadecimal Notation, Binary Notation, Convert the Following Notations, Expressed in Decimal, Signed Representations, Floating Point Representation

Typology: Exams

2012/2013

Uploaded on 04/08/2013

sehgal_98
sehgal_98 🇮🇳

4.8

(4)

121 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 A 11:00am Computer Engineering Spring 2011
4 problems, 5 pages Exam Two 9 March 2011
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
31 24 24 21 100
1
pf3
pf4
pf5

Partial preview of the text

Download Most Positive - Computer Engineering - Exam and more Exams Computer Science in PDF only on Docsity!

4 problems, 5 pages Exam Two 9 March 2011

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

31 24 24 21 100

4 problems, 5 pages Exam Two 9 March 2011 Problem 1 ( 3 parts, 31 points) Numbers of Reason Part A ( 13 points) Convert the following notations:

binary notation decimal notation 1 1100 1001. 1001 497

binary notation hexadecimal notation 101 1010 0101.0101 1010 101 CA11.CAB

Part B (12 points) For the 25 bit representations below, determine the most positive value and the step size (difference between sequential values). All answers should be expressed in decimal notation. Fractions (e.g., 3/16ths) may be used. Signed representations are two’s complement.

representation most positive value step size unsigned fixed-point ( 20 bits). ( 5 bits) signed integer ( 25 bits). (0 bits) signed fixed-point ( 13 bits). ( 12 bits) signed fixed-point ( 9 bits). ( 16 bits)

Part C ( 6 points) A 25 bit floating point representation has a 17 bit mantissa field, a 7 bit exponent field, and one sign bit.

What is the largest value that can be represented (closest to infinity)? 2 _________

What is the smallest value that can be represented (closest to zero)? 2 _________

How many decimal significant figures are supported? _________

4 problems, 5 pages Exam Two 9 March 2011 Problem 3 (3 parts, 24 points) Achieve a Happy State Part A ( 10 points) Implement a transparent latch using only pass gates and inverters.

IN EN OUT OUT

A 0

A 1

Part B ( 8 points) Implement a one bit register with write enable using only the components drawn below. Label inputs In , write enable WE , clocks ф 1 , and ф 2 , and output Out.

In Out En

Latch

In Out En

Latch

I

I1S

2to1mux

Part C (6 points) Assume the following signals are applied to a register. Draw the output signal Out. Draw a vertical line where In is sampled. Draw crosshatch where Out is unknown.

WE

In

Out

4 problems, 5 pages Exam Two 9 March 2011 Problem 4 (3 parts, 21 points) “A chip off the old block” Part A ( 15 points) Consider the five definitions for the block drawn below. One block input is the logical value A. The other input is the control value C. The output behavior for each of the five definitions is given in the table. Complete the full truth table and state the logical (gate) names for each definition. (hint: the first block one appears to mask A when its control input is low.)

A IN C

Out In^ C^ i^ ^ ^ ^ 

A 0 0 A A A Zo A 1 A A 0 1 A

In C i    

i  

Part B ( 6 points) The circuit below is built using these blocks. Describe its behavior. Also give the circuits common name.

X

Y

i

IN  Out

C O

I (^) N C

I (^) N O C

O

I N C

O (^) IN^ C O

i

X Y Out 0 0 1 0 0 1 1 1

It's a