整数的原码,反码和补码（The integer of the original code, complement and complement）.docVIP

下载本文档

2
0
约 9页
2017-08-21 发布于河南
举报
版权申诉

整数的原码,反码和补码（The integer of the original code, complement and complement）.doc

1、本文档共9页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

整数的原码,反码和补码（The integer of the original code, complement and complement）

整数的原码,反码和补码（The integer of the original code, complement and complement） An integer. The original code, complement and complement A: when faced with an integer, write the corresponding code, complement and complement. Integer (integer, zero and negative integer) said there are three methods, respectively: The original code representation (the size of the symbol (sign-and-magnitude) representation) Complement representation (1s complement representation (ones complement)) Complement representation (2s complement representation (twos complement)) 1. positive integer code, complement and complement When faced with a positive integer, N original code write corresponding to the N and N complement complement the rules are the same, the details are as follows: the left most position is 0; write a binary number corresponding to the positive integer, and then the results will be put in the right position; the remaining among all 0. 1 examples: 8 positive integers corresponding to the original code 27, what is the 8 one and the 8 complement respectively? Whether they are the same? Example 2: what is the original 8 positive integer corresponding to the 15 and 16 bit code respectively? 2. negative integer code, complement and complement 1) negative integer code When faced with a negative integer, write the corresponding N source code rules are as follows: the left most position is 1; the absolute value of the write negative integer binary number corresponding to, and then the results will be put in the right position; the remaining among all 0. Example: what is the 8 original negative integer corresponding to the -25? Answer:2) negative integer code When faced with a negative integer, write the corresponding n negative rules are as follows: the left most position is 1; the absolute value of a binary number corresponding to write this negative integer, and then the results will be put on the right side of the middle; the remaining bits are all 0; finally the rightmost