汇编语言与接口技术叶继华(第二版)习题答案习题一解答： 1.3（1）[0.0000]原=0.0000[0.0000]反=0.0000[0.0000]补=0.0000（2）[0.1001]原=0.1001[0.1001]反=0.1001[0.1001]补=0.1001（3）[-1001]原=11001[-1001]反=10110[-1001]补=101111.4[N]反=1.0101[N]原=1.1010[N]补=1.0110N=-0.10101.5(1)原码运算：比较可知，正数较大，用正数减负数，结果为正 01010011-00110011=[01010011]原-[00110011]原=00100000反码运算：01010011-00110011=[01010011]反+[-00110011]反=001010011+111001100=000011111补码运算：01010011-00110011=[01010011]补+[-00110011]补=001010011+111001101=000100000(2)原码运算：比较可知，负数较大，用负数减正数，结果为负0.100100-0.110010=[0.110010]原-[0.100100]原=-0.001110反码运算：0.100100-0.110010=[0.100100]反+[-0.110010]反=0.100100+1.001101=1.110001补码运算：0.100100-0.110010=[0.100100]补+[-0.110010]补=0.100100+1.001110=1.1100107643101.6(1)(11011011)2=(1×2+1×2+1×2+1×2+1×2+1×2)10=(219)10=(001000011001)BCD(2)(456)10=(010001010110)BCD210(3)(174)8=(1×8+7×8+4×8)10=(124)10=(000100100100)BCD210(4)(2DA)16=(2×16+13×16+10×16)10=(730)10=(011100110000)BCD1.7(1)9876H看成有符号数时，默认为负数的补码，转换为十进制数是：-265069876H=1001100001110110B为负数的补码，对其求补得到正数的补码，即 [1001100001110110B]补=0110011110001010B14131098731=(1×2+1×2+1×2+1×2+1×2+1×2+1×2+1×2)10=26506所以原负数为-26506(2)9876H看成无符号数时，转换为十进制数是：39030151211654219876H=1001100001110110B=(1×2+1×2+1×2+1×2+1×2+1×2+1×2+1×2)10=390301.8（1）98的压缩 BCD码为：10011000B（2）98的非压缩BCD码为：0000100100001000B1.9(1)[S1+S2]补=[S1]补+[S2]补=00010110+00100001=00110111，无溢出[S1-S2]补=[S1]补+[-S2]补=00010110+11011111=11110101，无溢出(2)[S1+S2]补=[S1]补+[S2]补=00010110+11011111=11110101，无溢出[S1-S2]补=[S1]补+[-S2]补=00010110+00100001=00110111，无溢出(3)[S1+S2]补=[S1]补+[S2]补=01100100+00011110=10000010，有溢出[S1-S2]补=[S1]补+[-S2]补=01100100+11100010=01000110，无溢出(4)[S1+S2]补=[S1]补+[S2]补=10011100+11100010=01111110，有溢出[S1-S2]补=[S1]补+[-S2]补=10011100+00011110=10111010，无溢出习题二...
