3.6 Problems Solutions
1. base 2, 4, 8, and 16 numbers translate more naturally to the numbers stored in the computer.
2. no, it is four nibbles
3. Both of these are coding schemes designed to increase immunity to noise. A parity bit can be used to check for a changed bit in a byte. Gray code can be used to check for a value error in a stream of continuous values.
4. a) 1101 0100 0011 0001, b) 3117
9. 1100001 odd parity bit = 1
15. a) 3532 = 0011 0101 0011 0010 = DCC, b0 the number is not a valid BCD
18. a) 9651, 2438, 4351, b) 0010 0101 1011 0011, 0000 1001 1000 0110, 0001 0000 1111 1111, c) 16440, d) 1, 0, 0
19. The binary value is 1111 0100 1001, so the second bit is 0
20. when selecting the sequence of bit changes for Karnaugh maps, only one bit is changed at a time. This is the same method used for grey code number sequences. By using the code the bits in the map are naturally grouped.
