| |
| | 1.2.1 Representing Data (Site not responding. Last check: 2007-10-20) |
 | | Such an expression is commonly written as a sum of the contribution of each digit, starting with the lowest order digit and working toward the largest weight; that is, as sums of contributions of digits starting from the rightmost position and working toward the left. |
 | | In binary we can use one bit within a representation (usually the most significant or leading bit) to indicate either positive (0) or negative (1), and store the unsigned binary representation of the magnitude in the remaining bits. |
 | | Likewise, for base 8 (octal) the digit symbols are [0, 1, 2, 3, 4, 5, 6, 7]; and for hexadecimal (base 16) they are [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f]. |
| www-ee.eng.hawaii.edu /Courses/EE150/Book/chap1/subsection2.1.2.1.html (2298 words) |
|