Homework03-sol - 2/7/03 4:23 PM Homework #03 (Solution)...

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

View Full Document Right Arrow Icon
2/7/03 4:23 PM ECSE-2660 Computer Architecture, Networks, & Operating Systems, Spring 2003 Page 1 of 3 Homework #03 (Solution) Binary arithmetic and floating-point representation 1a. (4 points) What is the smallest and largest unsigned numbers that can be represented using 16-bits? 0 and 65,535 Grading: 2pts for each correct number, 1pt for trying. 1b. (4 points) What is the largest unsigned number that can be represented using n bits? 2 n -1 Grading: 4pts for correct, 2pts for trying. 1c. (4 points) How many unsigned numbers can you represent using n bits? 2 n Grading: 4pts for correct, 2pts for trying. 2a. (4 points) What is the smallest 16-bit signed integer in hexadecimal form? 0x8000 Grading: 4pts for correct, 1pt for trying. 2b. (4 points) What is the largest 16-bit signed integer in hexadecimal form? 0x7FFF Grading: 4pts for correct, 1pt for trying. 2c. (4 points) Negate the signed 8-bit number represented by 0x8E. Flip all bits and add 1 0x8e= 1000 1110 flip = 0111 0001 add 1 = 0111 0010 =0x72 Grading: 4pts for correct, 1pt for trying. The main advantage of using two's complement representation for signed numbers is the fact that the same procedure can be used to add or subtract signed and unsigned
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 04/25/2010 for the course ECSE ecse-2340 taught by Professor Wozny during the Spring '09 term at Rensselaer Polytechnic Institute.

Page1 / 3

Homework03-sol - 2/7/03 4:23 PM Homework #03 (Solution)...

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