I l @ ve RuBoard |
Convert the following decimal values to binary:
3
13
59
119
Convert the following binary values to decimal, octal, and hexadecimal:
00010101
01010101
01001100
10011101
Evaluate the following expressions; assume each value is 8 bits:
~3
3 & 6
3 6
1 6
3 ^ 6
7 « 1
7 « 2
Evaluate the following expressions; assume each value is 8 bits:
~0
!0
2 & 4
2 & 4
2 4
2 4
5 « 3
Because the ASCII code uses only the final 7 bits, sometimes it is desirable to mask off the other bits. What's the appropriate mask in binary? In decimal? In octal? In hexadecimal?
In Listing 15.2, you can replace
while (bits-- > 0) { mask = bitval; bitval = 1; }
with
while (bits-- > 0) { mask += bitval; bitval *= 2; }
and the program still works. Does this mean the operation *=2 is equivalent to «= 1 ? What about = and += ?
The Tinkerbell computer has a hardware byte that can be read into a program. This byte contains the following information:
Bit(s) | Meaning |
---|---|
0 “1 | Number of 1.4MB floppy drives |
2 | Not used |
3 “4 | Number of CD-ROM drives |
5 | Not used |
6 “7 | Number of hard drives |
Like the IBM PC, the Tinkerbell fills in structure bit fields from right to left. Create a bit-field template suitable for holding the information.
The Klinkerbell, a near Tinkerbell clone, fills in structures from left to right. Create the corresponding bit-field template for the Klinkerbell.
I l @ ve RuBoard |