Transcription of CHAPTER 2 Data Representation in Computer Systems
{{id}} {{{paragraph}}}
Example: bankruptcy
CHAPTER 2 Data Representation in Computer Systems
CHAPTER 2. Data Representation in Computer Systems Introduction 47. Positional Numbering Systems 48. Converting Between Bases 48. Converting Unsigned Whole Numbers 49. Converting Fractions 51. Converting between Power-of-Two Radices 54. Signed Integer Representation 54. Signed Magnitude 54. Complement Systems 60. Unsigned Versus Signed Numbers 66. Computers, Arithmetic, and Booth's Algorithm 66. Carry Versus Overflow 70. binary Multiplication and Division Using Shifting 71. Floating-Point Representation 73. A Simple Model 74. Floating-Point Arithmetic 76. Floating-Point Errors 78. The IEEE-754 Floating-Point Standard 79. Range, Precision, and Accuracy 81. Additional Problems with Floating-Point Numbers 82. Character Codes 85. binary -Coded Decimal 86. EBCDIC 87. ASCII 88. Unicode 88. Error Detection and Correction 92. Cyclic Redundancy Check 92. Hamming Codes 95. Reed-Soloman 102. CHAPTER Summary 103. CMPS375 Class Notes (Chap02) Page 1 / 20 by Kuo-pao Yang Introduction 47.
If the 4-bit binary value 1101 is unsigned, then it represents the decimal value 13, but as a signed two’s complement number, it represents -3. • C programming language has and unsigned intint as possible types for integer variables. • If we are using 4-bit unsigned binary numbers and we add 1 to 1111, we get 0000 (“return to zero”). •
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: