CS251 : CS251-PPT#4-W13.pdf
Document Summary
[with material from computer organization and design by patterson and hennessy, and digital design and. Computer architecture by harris and harris, both published by morgan kaufmann] Range: 2n 1 + 1 to +2n 1 1 (cannot represent 2n 1 and 2n 1) = (0 + + 8 + 0 + 2 + 1) = 1110. 0 is represented twice as 1000 00002 and 0000 00002. Not trivial to perform arithmetic operations such as addition and. Not trivial to perform arithmetic operations such as addition and subtraction. Left-most bit represents the sign (1 for negative, 0 for non- negative) Range: 2n 1 to +2n 1 1 (cannot represent 2n 1) t 2n 1) Using 32 bits t 2 147 483 648 t. Easier to perform arithmetic operations such as addition and subtraction (see the discussion that follows) subtraction (see the discussion that follows) The most significant bit (msb) or the sign bit.
