This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: +01111001 11110010 OVERFLOW (sum of two positive integers > 111 1111) (f) 11111001 +11111001 11110010 OVERFLOW (sum of two negative integers < 1 111 1111) 9/09/09 SOLUTION ECSE2610 COCO: HW # 1 9/9/09 5. (4 points) Perform the following additions of 2s complement numbers, showing all the carries. Verify the addition by converting to decimal. (a) 0011 1110 + 0011 0111 0111 0101 = 62+55 = 117 (b) 1100 0011 + 0110 0101 0010 1000 = 61 + 101 = 40 6. (5 points) (a) What is the largest 12bit signmagnitude number? 0111 1111 1111 = 2047 (b) What is the smallest (i.e., negative) 12bit signmagnitude number? 1111 1111 1111= 2047 (c) What is the largest 12bit 2s complement number? 0111 1111 1111 = 2047 (d) What is the smallest 12bit 2s complement number? 1000 0000 0000 0000 = 2048 (e) How many different values can be represented with 10 bits? 1024...
View
Full
Document
This note was uploaded on 03/03/2010 for the course ECSE 2610 taught by Professor Ji during the Spring '08 term at Rensselaer Polytechnic Institute.
 Spring '08
 Ji

Click to edit the document details