(Use the smallest possible number of bits for each; i.e., no "leading
zeros".)
Hint: You will need more than 8 bits for these. After the 128s
place, comes the 256s place (256=128*2), then the 512s place
(512=256*2), etc.
(b)
Compute 2^1, 2^2, ..., 2^8, 2^9
(where 2^n = 2x2x...x2 (n times); e.g., 2^4 = 2x2x2x2).
(c)
What is the relationship between your answers to part (a) and your
answers to part (b)?
| DUE: AT THE START OF LECTURE: WED., SEP. 20 |