This preview shows pages 1–2. Sign up to view the full content.
ECE 2030 A 11:00am
Computer Engineering
Spring 2011
4 problems, 5 pages
Exam Two Solution
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
457.5625
1 1111 0001
497
1 1001.11
25.75
binary notation
hexadecimal notation
101 1010 0101.0101 1010 101
5A5.5AA
1100 1010 0001 0001.1100 1010 1011
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 fixedpoint
(20 bits) . (5 bits)
1M
1/32
signed integer
(25 bits) . (0 bits)
16M
1
signed fixedpoint
(13 bits) . (12 bits)
4K
1/4K
signed fixedpoint
(9 bits) . (16 bits)
256
1/64K
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)?
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 10/26/2011 for the course ECE 2030 taught by Professor Wolf during the Spring '07 term at Georgia Institute of Technology.
 Spring '07
 WOLF

Click to edit the document details