计算机组成与设计 第五版答案 CH Solution.docxVIP

3 3 Solutions S- PAGE 13 S- PAGE 13 Chapter 3 Solutions S- PAGE 10 S- PAGE 10 Chapter 3 Solutions 3.1 5730 3.2 5730 3.3 0101111011010100 Tehattraction is that each hex digit contains one of 16 dieffrent characters (0–9, A–E). Since with 4 binary bits you can represent 16 different patterns, in hex each digit requires exactly 4 binary bits. And bytes are by denfition 8 bits long, so two hex digits are all that are required to represent the contents of 1 byte. 3.4 753 3.5 7777 (?3777) Neither (63) Neither (65) Overflow (result ? ?179, which does not ifni to an SM 8-bit format) 3.9 ?105 ? 42 ? ?128 (?147) 3.10 ?105 ? 42 ? ?63 3.11 151 ? 214 ? 255 (365) StepActionMultiplierMultiplicandProduct Step Action Multiplier Multiplicand Product 0 Initial Vals 001 010 000 000 110 010 000 000 000 000 lsb=0, no op 001 010 000 000 110 010 000 000 000 000 1 Lshift Mcand 001 010 000 001 100 100 000 000 000 000 Rshift Mplier 000 101 000 001 100 100 000 000 000 000 Prod=Prod+Mcand 000 101 000 001 100 100 000 001 100 100 2 Lshift Mcand 000 101 000 011 001 000 000 001 100 100 Rshift Mplier 000 010 000 011 001 000 000 001 100 100 lsb=0, no op 000 010 000 011 001 000 000 001 100 100 3 Lshift Mcand 000 010 000 110 010 000 000 001 100 100 Rshift Mplier 000 001 000 110 010 000 000 001 100 100 Prod=Prod+Mcand 000 001 000 110 010 000 000 111 110 100 4 Lshift Mcand 000 001 001 100 100 000 000 111 110 100 Rshift Mplier 000 000 001 100 100 000 000 111 110 100 lsb=0, no op 000 000 001 100 100 000 000 111 110 100 5 Lshift Mcand 000 000 011 001 000 000 000 111 110 100 Rshift Mplier 000 000 011 001 000 000 000 111 110 100 lsb=0, no op 000 000 110 010 000 000 000 111 110 100 6 Lshift Mcand 000 000 110 010 000 000 000 111 110 100 Rshift Mplier 000 000 110 010 000 000 000 111 110 100 Step0ActionMultiplicandProduct/Multiplier Step 0 Action Multiplicand Product/Multiplier 1 2 3 4 5 6 Initial Vals 110 010 000 000 001 010 lsb=0, no op 110 010 000 000 001 010 Rshift Product 110 010 000 000 000 101 Prod=Prod+M