Computer Number System
Computer Number System
Base Symbols
10 2 8 16 0, 1, 9 0, 1 0, 1, 7 0, 1, 9, A, B, F
Quantities/Counting (1 of 3)
Decimal 0 1 2 3 4 5 6 7 HexaBinary Octal decimal 0 0 0 1 1 1 10 2 2 11 100 101 110 111 3 4 5 6 7 3 4 5 6 7
p. 33
Quantities/Counting (2 of 3)
Decimal 8 9 10 11 12 13 14 15 HexaBinary Octal decimal 1000 10 8 1001 11 9 1010 12 A 1011 1100 1101 1110 1111 13 14 15 16 17 B C D E F
Quantities/Counting (3 of 3)
Decimal 16 17 18 19 20 21 22 23 HexaBinary Octal decimal 10000 20 10 10001 21 11 10010 22 12 10011 10100 10101 10110 10111 23 24 25 26 27 13 14 15 16 17
Etc.
Binary
Hexadecimal
pp. 4046
Quick Example
Decimal
Octal
Binary
Hexadecimal
Next slide
Weight
12510 =>
Base
Binary to Decimal
Decimal Octal
Binary
Hexadecimal
Binary to Decimal
Technique
Multiply each bit by 2n, where n is the weight of the bit The weight is the position of the bit, starting from 0 on the right Add the results
Example
Bit 0 1010112 => 1 x 20 = 1 x 21 0 x 22 1 x 23 0 x 24 1 x 25 1 = 2 = 0 = 8 = 0 = 32 4310
Octal to Decimal
Decimal Octal
Binary
Hexadecimal
Octal to Decimal
Technique
Multiply each bit by 8n, where n is the weight of the bit The weight is the position of the bit, starting from 0 on the right Add the results
Example
7248 =>
4 x 80 = 2 x 81 = 7 x 82 =
4 16 448 46810
Hexadecimal to Decimal
Decimal Octal
Binary
Hexadecimal
Hexadecimal to Decimal
Technique
Multiply each bit by 16n, where n is the weight of the bit The weight is the position of the bit, starting from 0 on the right Add the results
Example
ABC16 =>
Decimal to Binary
Decimal Octal
Binary
Hexadecimal
Decimal to Binary
Technique
Divide by two, keep track of the remainder First remainder is bit 0 (LSB, least-significant bit) Second remainder is bit 1 Etc.
Example
12510 = ?2 2 125 2 62 1
2 2
2 2 2
31
15 7 3 1
0
1 1 1 1
12510 = 11111012
Octal to Binary
Decimal Octal
Binary
Hexadecimal
Octal to Binary
Technique
Convert each octal digit to a 3-bit equivalent binary representation
Example
7058 = ?2
111
000
101
7058 = 1110001012
Hexadecimal to Binary
Decimal Octal
Binary
Hexadecimal
Hexadecimal to Binary
Technique
Convert each hexadecimal digit to a 4-bit equivalent binary representation
Example
10AF16 = ?2
0001
0000
1010
1111
10AF16 = 00010000101011112
Decimal to Octal
Decimal Octal
Binary
Hexadecimal
Decimal to Octal
Technique
Divide by 8 Keep track of the remainder
Example
123410 = ?8
8
8 8 8
1234 154
19
2 2
2
0
3
2
123410 = 23228
Decimal to Hexadecimal
Decimal Octal
Binary
Hexadecimal
Decimal to Hexadecimal
Technique
Divide by 16 Keep track of the remainder
Example
123410 = ?16
16
16 16
1234 77
4
2 13 = D
123410 = 4D216
Binary to Octal
Decimal Octal
Binary
Hexadecimal
Binary to Octal
Technique
Group bits in threes, starting on right Convert to octal digits
Example
10110101112 = ?8
011
010
111
10110101112 = 13278
Binary to Hexadecimal
Decimal Octal
Binary
Hexadecimal
Binary to Hexadecimal
Technique
Group bits in fours, starting on right Convert to hexadecimal digits
Example
10101110112 = ?16
10
1011
1011
10101110112 = 2BB16
Octal to Hexadecimal
Decimal Octal
Binary
Hexadecimal
Octal to Hexadecimal
Technique
Use binary as an intermediary
Example
10768 = ?16 1 0 7 6
001 2
000 3
111
110 E
10768 = 23E16
Hexadecimal to Octal
Decimal Octal
Binary
Hexadecimal
Hexadecimal to Octal
Technique
Use binary as an intermediary
Example
1F0C16 = ?8 1 F 0 C
0001 1
1111 7 4
0000 1
1100 4
1F0C16 = 174148
Hexadecimal
703
1AF
Exercise Convert
Answer
Decimal 33 117
Octal 41 165
Hexadecimal 21 75
451
431
111000011
110101111
703
657
1C3
1AF
Common Powers (1 of 2)
Base 10
Power
10-12 10-9 10-6 10-3 103
Symbol p n m k
106
109 1012
mega
giga tera
M
G T
1000000
1000000000 1000000000000
Common Powers (2 of 2)
Base 2
Power
210 220 230
Symbol k M G
What is the value of k, M, and G? In computing, particularly w.r.t. memory, the base-2 interpretation generally applies
Example
In the lab 1. Double click on My Computer 2. Right click on C: 3. Click on Properties
/ 230 =
Bytes
GB
Binary Addition (1 of 2)
Two 1-bit values
A 0 0 1 1 B 0 1 0 1 A+B 0 1 1 10
two pp. 3638
Binary Addition (2 of 2)
Two n-bit values
Add individual bits Propagate carries E.g.,
10101 + 11001 101110
1 1
21 + 25 46
Multiplication (1 of 3)
Decimal (just for fun)
35 x 105 175 000 35 3675
pp. 39
Multiplication (2 of 3)
Binary, two 1-bit values
A 0 0 1 1 B 0 1 0 1 AB 0 0 0 1
Multiplication (3 of 3)
Binary, two n-bit values
As with decimal values E.g., 1110
x 1011 1110 1110 0000 1110 10011010
Fractions
Decimal to decimal (just for fun)
3.14 => 4 x 10-2 = 0.04 1 x 10-1 = 0.1 3 x 100 = 3 3.14
pp. 4650
Fractions
Binary to decimal
10.1011 => 1 x 2-4 = 0.0625 1 x 2-3 = 0 x 2-2 = 1 x 2-1 = 0 x 20 = 1 x 21 = 0.125 0.0 0.5 0.0 2.0 2.6875
pp. 4650
Fractions
Decimal to binary
3.14579 .14579 x 2 0.29158 x 2 0.58316 x 2 1.16632 x 2 0.33264 x 2 0.66528 x 2 1.33056 etc. p. 50
11.001001...
Octal
Hexadecimal
Exercise Convert
Answer
Binary Octal 11101.110011 35.63 101.1101 11.000111 1100.10000010 5.64 3.07 14.404
Hexadecimal
1D.CC 5.D 3.1C C.82
2.63
There are some exceptions to the addition rule we just mentioned, as shown in Example 2.24.
2.64
Example 2.24
Roman numerals are a good example of a non-positional number system. This number system has a set of symbols S = {I, V, X, L, C, D, M}. The values of each symbol are shown in Table 2.3
To find the value of a number, we need to add the value of symbols subject to specific rules (See the textbook).
2.65
Example 2.24
(Continued)
2.66
Thank you