Number Systems Negative Integers and Floating Point数字系统的负整数和浮点数.pptVIP

下载本文档

1
0
约3.49千字
约 10页
2018-06-22 发布于江西
举报
版权申诉

Number Systems Negative Integers and Floating Point数字系统的负整数和浮点数.ppt

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

Number Systems Negative Integers and Floating Point数字系统的负整数和浮点数.ppt

Negative Numbers in Binary Four different representation schemes are used for negative numbers Signed Magnitude Left most bit (LMB) is the sign bit : 0 ? positive (+) 1 ? negative (-) Remaining bits hold absolute magnitude Example: 210 ? 0000 0010b -210 ? 1000 0010b Q: 0000 0000 = ? 1000 0000 = ? 1’s Complement One’s Complement Left most bit is the sign bit : 0 ? positive (+) 1 ? negative (-) The magnitude is Complemented Example: 210 ? 0 000 0010b -210 ? 1 111 1101b Exercise: try - 410 using 1’s Complement Q: 0000 0000 = ? 1111 1111 = ? 2’s Complement 2’s Complement 710 = 0000 0111b 310 = 0000 0011b 1’s complement 1111 1100b 2’s complement 1111 1101b ? -310 7+(-3) ? 0000 0111 + 1111 1101 Three Representation of Signed Integer Negative Numbers in Binary (cont.) Excess Representation For a given fixed number of bits the range is remapped such that roughly half the numbers are negative and half are positive. Example: (as left) Excess – 8 notation for 4 bit numbers Binary value = 8 + excess-8 value MSB can be used as a sign bit, but If MSB =1, positive number If MSB =0, negative number Excess Representation is also called bias Fundamental Data Types Fundamental Data Types Four Data Types in C (assume 2’s complement, byte machine) Acknowledgements These slides where originally prepared by Dr. Jeffrey Huang, updated by Dale Roberts. * Dale Roberts * Dale Roberts Department of Computer and Information Science,School of Science, IUPUI CSCI 230 Information Representation: Negative Integer Representation Dale Roberts, Lecturer IUPUI droberts@cs.iupui.edu Try, 1000 0100b = -410 Solution: 410 = 0 000 0100 b -410 = 111 1011 b 1 2’s Complement Sign bit same as above Magnitude is Complemented first and a “1” is added to the Complemented digits Example: 210 ? 0 000 0010b 1’s Complement ? 1 111 1101b + 1 -210 ? 1 1