Professional Documents
Culture Documents
Data Representation in
Computer Systems
You Can Join Our Ongoing Class
For ASSISTANCE.
2
Chapter 2 Objectives
3
Chapter 2 Objectives
4
2.1 Introduction
5
2.1 Introduction
6
2.2 Positional Numbering Systems
7
2.2 Positional Numbering Systems
9 10 2 + 4 10 1 + 7 10 0
5 10 3 + 8 10 2 + 3 10 1 + 6 10 0
+ 4 10 -1 + 7 10 -2
8
2.2 Positional Numbering Systems
9
2.3 Decimal to Binary Conversions
10
2.3 Decimal to Binary Conversions
11
2.3 Decimal to Binary Conversions
12
2.3 Decimal to Binary Conversions
13
2.3 Decimal to Binary Conversions
14
2.3 Decimal to Binary Conversions
15
2.3 Decimal to Binary Conversions
16
2.3 Decimal to Binary Conversions
17
2.3 Decimal to Binary Conversions
18
2.3 Decimal to Binary Conversions
19
2.3 Decimal to Binary Conversions
22
2.3 Decimal to Binary Conversions
23
2.3 Decimal to Binary Conversions
24
2.3 Decimal to Binary Conversions
25
2.3 Decimal to Binary Conversions
26
2.3 Decimal to Binary Conversions
27
2.3 Decimal to Binary Conversions
29
2.4 Signed Integer Representation
30
2.4 Signed Integer Representation
31
2.4 Signed Integer Representation
32
2.4 Signed Integer Representation
• Example:
– Using signed magnitude
binary arithmetic, find the
sum of 75 and 46.
• First, convert 75 and 46 to
binary, and arrange as a sum,
but separate the (positive) sign
bits from the magnitude bits.
33
2.4 Signed Integer Representation
• Example:
– Using signed magnitude
binary arithmetic, find the
sum of 75 and 46.
• Just as in decimal arithmetic,
we find the sum starting with
the rightmost bit and work left.
34
2.4 Signed Integer Representation
• Example:
– Using signed magnitude
binary arithmetic, find the
sum of 75 and 46.
• In the second bit, we have a
carry, so we note it above the
third bit.
35
2.4 Signed Integer Representation
• Example:
– Using signed magnitude
binary arithmetic, find the
sum of 75 and 46.
• The third and fourth bits also
give us carries.
36
2.4 Signed Integer Representation
• Example:
– Using signed magnitude binary
arithmetic, find the sum of 75
and 46.
• Once we have worked our way
through all eight bits, we are
done.
37
2.4 Signed Integer Representation
• Example:
– Using signed magnitude binary
arithmetic, find the sum of 107
and 46.
• We see that the carry from the
seventh bit overflows and is
discarded, giving us the
erroneous result: 107 + 46 = 25.
38
2.4 Signed Integer Representation
39
2.4 Signed Integer Representation
40
2.4 Signed Integer Representation
41
2.4 Signed Integer Representation
42
2.4 Signed Integer Representation
44
2.4 Signed Integer Representation
45
2.4 Signed Integer Representation
46
2.4 Signed Integer Representation
47
2.4 Signed Integer Representation
48
2.4 Signed Integer Representation
• Example:
– Using two’s complement binary
arithmetic, find the sum of 107
and 46.
• We see that the nonzero carry
from the seventh bit overflows into
the sign bit, giving us the
erroneous result: 107 + 46 = -103.
Rule for detecting signed two’s complement overflow: When the
“carry in” and the “carry out” of the sign bit differ, overflow has
occurred.
49
2.4 Signed Integer Representation
50
2.4 Signed Integer Representation
51
2.4 Signed Integer Representation
0011
00010010
52
x 01111110
+ 111111111001011
• Here is a larger + 00000000000000
example.
+ 0000000000000
+ 000000000000
+ 00000000000
+ 000110101_______
10001101000010110
53
2.4 Signed Integer Representation
54
2.4 Signed Integer Representation
55
2.5 Floating-Point Representation
56
2.5 Floating-Point Representation
57
2.5 Floating-Point Representation
58
2.5 Floating-Point Representation
59
2.5 Floating-Point Representation
60
2.5 Floating-Point Representation
61
2.5 Floating-Point Representation
63
2.5 Floating-Point Representation
• Example:
– Express 3210 in the simplified 14-bit floating-point
model.
• We know that 32 is 25. So in (binary) scientific
notation 32 = 1.0 x 25 = 0.1 x 26.
• Using this information, we put 110 (= 610) in the
exponent field and 1 in the significand as shown.
64
2.5 Floating-Point Representation
65
2.5 Floating-Point Representation
66
2.5 Floating-Point Representation
67
2.5 Floating-Point Representation
68
2.5 Floating-Point Representation
• Example:
– Express 3210 in the revised 14-bit floating-point model.
• We know that 32 = 1.0 x 25 = 0.1 x 26.
• To use our excess 16 biased exponent, we add 16 to
6, giving 2210 (=101102).
• Graphically:
69
2.5 Floating-Point Representation
• Example:
– Express 0.062510 in the revised 14-bit floating-point
model.
• We know that 0.0625 is 2-4. So in (binary) scientific
notation 0.0625 = 1.0 x 2-4 = 0.1 x 2 -3.
• To use our excess 16 biased exponent, we add 16 to
-3, giving 1310 (=011012).
70
2.5 Floating-Point Representation
• Example:
– Express -26.62510 in the revised 14-bit floating-point
model.
• We find 26.62510 = 11010.1012. Normalizing, we have:
26.62510 = 0.11010101 x 2 5.
• To use our excess 16 biased exponent, we add 16 to 5,
giving 2110 (=101012). We also need a 1 in the sign bit.
71
2.5 Floating-Point Representation
72
2.5 Floating-Point Representation
73
2.5 Floating-Point Representation
74
2.5 Floating-Point Representation
• Example:
– Find the sum of 1210 and 1.2510 using the 14-bit floating-point
model.
• We find 1210 = 0.1100 x 2 4. And 1.2510 = 0.101 x 2 1 =
0.000101 x 2 4.
• Thus, our sum is
0.110101 x 2 4.
75
2.5 Floating-Point Representation
76
2.5 Floating-Point Representation
• Example:
– Find the product of 1210 and 1.2510 using the 14-bit
floating-point model.
• We find 1210 = 0.1100 x 2 4. And 1.2510 = 0.101 x 2 1.
• Thus, our product is
0.0111100 x 2 5 =
0.1111 x 2 4.
• The normalized
product requires an
exponent of 2210 =
101102.
77
2.5 Floating-Point Representation
78
2.5 Floating-Point Representation
79
2.5 Floating-Point Representation
128.5 - 128
0.39%
128.5
• If we had a procedure that repetitively added 0.5 to
128.5, we would have an error of nearly 2% after only
four iterations.
80
2.5 Floating-Point Representation
81
2.5 Floating-Point Representation
82
2.5 Floating-Point Representation
83
2.5 Floating-Point Representation
84
2.5 Floating-Point Representation
85
2.6 Character Codes
86
2.6 Character Codes
87
2.6 Character Codes
88
2.6 Character Codes
89
2.6 Character Codes
90
2.6 Character Codes
91
2.8 Error Detection and Correction
92
2.8 Error Detection and Correction
93
2.8 Error Detection and Correction
1+0=1 1+1=0
96
2.8 Error Detection and Correction
97
2.8 Error Detection and Correction
98
2.8 Error Detection and Correction
100
2.8 Error Detection and Correction
101
2.8 Error Detection and Correction
102
2.8 Error Detection and Correction
103
2.8 Error Detection and Correction
104
2.8 Error Detection and Correction
105
2.8 Error Detection and Correction
106
2.8 Error Detection and Correction
107
2.8 Error Detection and Correction
108
2.8 Error Detection and Correction
109
2.8 Error Detection and Correction
110
2.8 Error Detection and Correction
111
2.8 Error Detection and Correction
112
2.8 Error Detection and Correction
113
2.8 Error Detection and Correction
114
2.8 Error Detection and Correction
115
2.8 Error Detection and Correction
117
Chapter 2 Conclusion
118
End of Chapter 2
119