03~Chapter 3

# 03~Chapter 3 - 3 Solutions Solution 3.1 3.1.1 a. 7620 b....

This preview shows pages 1–5. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 Solutions Solution 3.1 3.1.1 a. 7620 b. 3626 3.1.2 a. 752 b. 3626 3.1.3 a. 2771 723 b. 103 103 3.1.4 a. 730 b. 1560 3.1.5 a. 730 b. 1560 3.1.6 a. 010111110010 b. 010110100110 The attraction is that each octal digit contains one of 8 different characters (07). Since with 3 binary bits you can represent 8 different patterns, in octal each digit requires exactly 3 binary bits. You can write down the conversion directly. S70 Chapter 3 Solutions Solution 3.2 3.2.1 a. EA4B b. F034 3.2.2 a. CFE3 b. 8406 3.2.3 a. 3380 3380 b. 47645 14877 3.2.4 a. 9662 b. 6321 3.2.5 a. DE96 b. F29D 3.2.6 a. 1011101001111100 b. 1010101011011111 The attraction is that each hex digit contains one of 16 different characters (09, AE). Since with 4 binary bits you can represent 16 different patterns, in hex each digit requires exactly 4 binary bits. And bytes are by defi nition 8 bits long, so two hex digits are all that are required to represent the contents of 1 byte. Chapter 3 Solutions S71 Solution 3.3 3.3.1 a. Underfl ow (21) b. Neither (58) 3.3.2 a. Overfl ow (result = 159, which does not fi t into an 8-bit SM format) b. Overfl ow (result = 146, which does not fi t into an SM 8-bit format) 3.3.3 a. Neither (21) b. Neither (58) 3.3.4 a. 56 + 103 = 47 b. 9 19 = 28 3.3.5 a. 56 103 = 128 (159) b. 9 + 19 = 10 3.3.6 a. 200 + 103 = 255 (303) b. 247 + 237 = 255 (484) S72 Chapter 3 Solutions Solution 3.4 3.4.1 a. 50 23 Step Action Multiplier Multiplicand Product Initial Vals 010 011 000 000 101 000 000 000 000 000 1 Prod = Prod + Mcand 010 011 000 000 101 000 000 000 101 000 Lshift Mcand 010 011 000 001 010 000 000 000 101 000 Rshift Mplier 001 001 000 001 010 000 000 000 101 000 2 Prod = Prod + Mcand 001 001 000 001 010 000 000 001 111 000 Lshift Mcand 001 001 000 010 100 000 000 001 111 000 Rshift Mplier 000 100 000 010 100 000 000 001 111 000 3 lsb = 0, no op 000 100 000 010 100 000 000 001 111 000 Lshift Mcand 000 100 000 101 000 000 000 001 111 000 Rshift Mplier 000 010 000 101 000 000 000 001 111 000 4 lsb = 0, no op 000 010 000 101 000 000 000 001 111 000 Lshift Mcand 000 010 001 010 000 000 000 001 111 000 Rshift Mplier 000 001 001 010 000 000 000 001 111 000 5 Prod = Prod + Mcand 000 001 001 010 000 000 001 011 111 000 Lshift Mcand 000 001 010 100 000 000 001 011 111 000 Rshift Mplier 000 000 010 100 000 000 001 011 111 000 6 lsb = 0, no op 000 000 001 010 000 000 001 011 111 000 Lshift Mcand 000 000 101 000 000 000 001 011 111 000 Rshift Mplier 000 000 101 000 000 000 001 011 111 000 b. 66 04 Step Action Multiplier Multiplicand Product Initial Vals 000 100 000 000 110 110 000 000 000 000 1 lsb = 0, no op 000 100 000 000 110 110 000 000 000 000 Lshift Mcand 000 100 000 001 101 100 000 000 000 000 Rshift Mplier 000 010 000 001 101 100 000 000 000 000 2 lsb = 0, no op 000 010 000 001 101 100 000 000 000 000 Lshift Mcand 000 010 000 011 011 000 000 000 000 000 Rshift Mplier 000 001 000 011 011 000 000 000 000 000 Chapter 3...
View Full Document

## 03~Chapter 3 - 3 Solutions Solution 3.1 3.1.1 a. 7620 b....

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online