fa04-sw-s2 - ECE 2030B 1:00am 4 problems, 4 pages Problem 1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 2030B 1:00am Computer Engineering Fall 2004 4 problems, 4 pages Exam Two Solutions 15 October 2004 1 Problem 1 (2 parts, 27 points) Representations and Arithmetic Part A (15 points) For the 28 bit representations below, determine the most negative value, most positive value, and step size (difference between sequential values). All answers should be expressed in decimal notation . Fractions (e.g., 3/16ths) may be used. All signed representations are two’s complement. representation most negative value most positive value step size signed integer (28 bits) . (0 bits) -128M +128M 1 unsigned fixed-point (14 bits) . (14 bits) 0 16K 1/16K unsigned fixed-point (19 bits) . (9 bits) 0 512K 1/512 signed fixed-point (19 bits) . (9 bits) -256K 256K 1/512 Part B (12 points) For each problem below, compute the operations using the rules of arithmetic, and indicate whether an overflow occurs assuming all numbers are expressed using a six bit unsigned fixed point representation and a six bit two’s complement fixed-point
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/17/2008 for the course ECE 2030 taught by Professor Wolf during the Fall '07 term at Georgia Institute of Technology.

Page1 / 4

fa04-sw-s2 - ECE 2030B 1:00am 4 problems, 4 pages Problem 1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online