Solutions Manual
Solutions Manual
Solutions Manual
CHAPTER 1
1.1 Base-10: 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
Octal: 20 21 22 23 24 25 26 27 30 31 32 33 34 35 36 37 40
Hex: 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F 20
Base-13 A B C 10 11 12 13 14 15 16 17 18 19 23 24 25 26
1.2 (a) 32,768 (b) 6,871,947,674
1.3 (4310)5 = 4 * 5 + 3 * 52 + 1 * 51 = 58010
3
(735)8 = 7 * 82 + 3 * 81 + 5 * 80 = 47710
1.4 14-bit binary: 11_1111_1111_1111
Decimal: 214 - 1 = 16,38310
Hexadecimal: 3FFF16
1.5 Let b = base
(a) 14/2 = (b + 4)/2 = 5, so b = 6
(b) (2 * b + 4) + (b + 7) = 4b, so b = 11
1.6 (x - 3)(x - 6) = x 2 - (6 + 3)x + 6 * 3 = x 2 - 11x + 22
Therefore: 6 + 3 = b + 1m so b = 8
Also, 6 * 3 = (18)10 = (22)8
1.7 68BE = 0110_1000_1011_1110 = 110_100_010_111_110 = (64276)8
1
SolutionCh1-10v2.qxd 11/26/07 3:45 PM Page 2
2 Solutions Manual
1011.11
101ƒ111011.0000
1.11 101
01001
101
1001
101
1000
101
0110
The quotient is carried to two decimal places, giving 1011.11
Checking: 1110112/1012 = 5910/510 1011.112 = 58.7510
1.12 (a) 10000 and 110111
1011
+101 1011
10000 = 1610 *101
1011
1011
110111 = 5510
SolutionCh1-10v2.qxd 11/26/07 3:45 PM Page 3
Solutions Manual 3
4 Solutions Manual
(a) 10001
1s comp: 01110
2s comp: 01111
10011
Diff: 00010
101000
(b) 1s comp: 1010111
2s comp: 1011000
001001
Diff: 1100001 (negative)
0011111 (2s comp)
-011111 (diff is -31)
1.19 +9286 : 009286; +801 : 000801; -9286 : 990714; -801 : 999199
(a) (+9286) + (-801) = 009286 + 000801 = 010087
(b) (-9286) + (+801) = 990714 + 000801 = 991515
1.20 +49 : 0_110001 (Needs leading zero indicate + value); +29 : 0_011101
Leading 0 indicates + value) -49 : 1_001111; -29 : 1_100011
(a) (+29) + (-49) = 0_011101 + 1_001111 = 1_101100 (1 indicates negative value.)
Magnitude = 0_010100; Result (+29) + (-49) = -20
(b) (-29) + (+49) = 1_100011 + 0_110001 = 0_010100 (0 indicates positive value)
(-29) + (+49) = +20
(c) Must increase word size by 1 (sign extension) to accomodate overflow of values:
(-29) + (-49) = 11_100011 + 11_001111 = 10_110010 (1 indicates negative
result)
Magnitude: 1_001110 = 7810
Result: (-29) + (-49) = -78
SolutionCh1-10v2.qxd 11/26/07 3:45 PM Page 5
Solutions Manual 5
6 Solutions Manual
1.27 For a deck with 52 cards, we need 6 bits (32 6 52 6 64). Let the msb’s select the suit
(e.g., diamonds, hearts, clubs, spades are encoded respectively as 00, 01, 10, and 11. The
remaining four bits select the “number” of the card. Example: 0001 (ace) through 1011
(9), plus 101 through 1100 (jack, queen, king). This a jack of spades might be coded as
11_1010. (Note: only 52 out of 64 patterns are used.)
1.28 G (dot) (space) B o o l e
01000111_11101111_01101000_01101110_00100000_11000100_11101111_11100101
1.29 Bill Gates
1.30 73 F4 E5 76 E5 4A EF 62 73
73: 0_111_0011 s
F4: 1_111_0100 t
E5: 1_110_0101 e
76: 0_111_0110 v
E5: 1_110_0101 e
4A: 0_100_1010 j
EF: 1_110_1111 o
62: 0_110_0010 b
73: 0_111_0011 s
1.31 62 + 32 = 94 printing characters
1.32 bit 6 from the right
1.33 (a) 897 (b) 871
1.34 ASCII for decimal digits with odd parity:
(0): 10110000 (1): 00110001 (2): 00110010 (3): 10110011
(4): 00110100 (5): 10110101 (6): 10110110 (7): 00110111
(8): 00111000 (9): 10111001
1.35 (a)
a b c
a
f
b
c
g
f
g
SolutionCh1-10v2.qxd 11/26/07 3:45 PM Page 7
Solutions Manual 7
1.36
a b
a
f
b
g
f
CHAPTER 2
2.1
(a)
000 0 1 1 1 1 1 000 0 1 1 1 1 1
001 1 0 1 1 0 0 001 0 1 1 1 0 1
010 1 0 1 0 1 0 010 0 1 1 0 1 1
011 1 0 1 0 0 0 011 0 1 1 0 0 1
100 1 0 0 1 1 0 100 0 1 0 1 1 1
101 1 0 0 1 0 0 101 0 1 0 1 0 1
110 1 0 0 0 1 0 110 0 1 0 0 1 1
111 1 0 0 0 0 0 111 1 0 0 0 0 0
(b) (c)
000 0 0 0 0 000 0 0 0 0
001 0 0 0 0 001 0 0 0 0
010 0 0 0 0 010 0 0 0 0
011 0 0 0 0 011 1 0 0 0
100 0 0 0 0 100 0 0 0 0
101 1 0 1 1 101 0 0 0 0
110 1 1 0 1 110 0 0 1 0
111 1 1 1 1 111 1 1 1 1