网站大量收购闲置独家精品文档,联系QQ:2885784924

(第十章)组成习题.ppt

  1. 1、本文档共17页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
(第十章)组成习题

2-1 Give the sign mag 、 1’s compl 、 2’s compl representation of the follow number(word length is 8), where MSB is the highest bit (sign bit),LSB is the lowest bit。If the number is decimal, the decimal point is behind the MSB; if the number is integer, then the decimal point is behind the LSB. (1)–35/64 (2)23/128 (3) –127 (4)– 1 (decimal representation) (5)– 1 (integer representation) 2-2 Rank these numbers:(small to large) 16,1010.11B,25.3Q,[X1] 2’s compl 1CH,[X2] 1’s compl 0110.1001BCD, [X3] sign mag [-X4] 2’s compl -[X5] 2’s compl Key : (1)unify all the forms, generally decimal is selected (2)transformation between B, Q, H and BCD; 3-1 设计一个A、B、C三人表决电路,当表决某个提案时,多数人同意提案通过,同时A具有否决权,用与非门实现。 6-1 Given a 32 bit floating-point number,1 bit for sign, 8 bit for E, represented by biased code, 23 bit for M, represented by 2’s Complement;radix is 2: (1)Maximal binary; (2)Minimal binary; (3)range; (4)positive and negative normalized representation float-point that closest to 0 6-2 Transform the follow decimal to IEEE754 32 bit float-point (1)27/64 (2)-27/64 6-3 Transform decimal -0.75 to IEEE754 32 bit single precision float-point number 6-4 Transform 0C0B00000H IEEE754 32 bit float-point number to Decimal 6-5 Transform (0.15)10 to Normalized floating-point numbers representation阶码: Sign of m: 1-bit Exponent: 8-bit, integer, biased code, radix =2 mantissa :23-bit, decimal, sign-mag, radix =2, implied leading 1 6-6 Transform (0.1)10 to Normalized floating-point numbers representation阶码: (1)Sign of m: 1-bit Exponent: 8-bit, integer, biased code, radix =2 mantissa :23-bit, decimal, sign-mag, radix =2, implied leading 1 (2)Sign of m: 1-bit Exponent: 7-bit, integer, biased code, radix =2 mantissa :6-bit, decimal, sign-mag, radix =16 6-7 Let X=2-010×0 Y=2-011×(-0, e=6 bits,m=10 bits(all with 2 sign bits , 2’s c ) X+Y? 9-1 10-1 设CPU共有16根地址线,8根

您可能关注的文档

文档评论(0)

hhuiws1482 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:5024214302000003

1亿VIP精品文档

相关文档