1 Number Systems

Number Systems
Instructor: Tsung-Che Chiang

tcchiang@ieee.org
Department of Computer Science and Information Engineering
National Taiwan Normal University
Introduction to Computer Science, Fall, 2010
Outline
 Positional Number Systems

 Conversion between Positional Number
Systems
 Non-positional Number Systems
 Summary
2
1
Introduction
 A number system defines how a number can

be represented using distinct symbols.
 A number can be represented differently

in different systems.
 For example, the two numbers (2A)16 and (52)8
both refer to the same quantity, (42)10.
3
Positional Number Systems

 In a positional number system, the position a
symbol occupies in the number determines the
value it represents.
 In this system, a number represented as:
has the value of:
b is the base.
B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 4

2
The Decimal System (base 10)
 The word decimal is derived from the Latin root
decem (ten).
 Base b = 10.
 Ten symbols: S = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
 The symbols in this system are often referred to
as decimal digits or just digits.
5
 Integer values

3
 Real values

 Abacus –a device that uses positional

notation to represent a decimal number.
8
4
The Binary System (base 2)
 The word binary is derived from the Latin root

bini (double).
 Base b = 2.
 Ten symbols: S = {0, 1}
as binary digits or just bits.
9
 Integer values
(11001)2 = (25)
? 10
5
 Real values
? 10
(101.11)2 = (5.75)

 Chinese binary system
12
6
The Hexadecimal System (base 16)
 The word hexadecimal is derived from the Greek

root hex (six) and Latin root decem (ten).
 Base b = 16.
 Ten symbols: S = {0, 1, …, 8, 9, A, B, C, D, E, F}
as hexadecimal digits.
13
The Hexadecimal System (base 16)
 Integer values
(2AE)16 = (686)
? 10
7
The Octal System (base 8)
 The word octal is derived from the Latin root octo

(eight).
 Base b = 8.
 Ten symbols: S = {0, 1, 2, 3, 4, 5, 6, 7}
15
The Octal System (base 8)
(1256)8 = (686)
? 10

8
Summary of the Four Positional
Number Systems

Summary of the Four Positional

Number Systems

9
Conversion between Number Systems
 We will introduce how to do the following

conversions:
 Binary/Hex/Octal  Decimal.
 Decimal  Binary/Hex/Octal.
 Binary  Hex/Octal
19
Conversion between Number Systems
 Binary/Hex/Octal  Decimal.
(110.11)2 = (6.75)10
10
Decimal-Others Conversion
 Decimal  Binary/Hex/Octal (Integral part)
B. Forouzan and F. Mosharraf,

Foundations of Computer Science, 2nd
ed., 2008.
21
 Decimal  Binary/Hex/Octal

11
 Decimal 35 = 17
2+1 = 17
21 + 120
= (8
2 + 1)
2+1 = 8
2 2 + 1
2 1 + 1
2 0
 Binary/Hex/Octal …
(35)10 = (100011)2

 Decimal
 Binary/Hex/Octal
(126)10 = (7E)
? 16
(126)10 = (176)
? 8

12
 Decimal  Binary/Hex/Octal (Fractional part)
B. Forouzan and F. Mosharraf,

Foundations of Computer Science, 2nd ed.,
2008.
25
B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008.

26
13
0.625 = 2-1(210.625) = 2-1 (1.25)

= 2-1(1 + 0.25)
= 2-1(1 + 2-1(210.25))
= 2-1(1 + 2-1(0 + 0.5))
= 2-1(1 + 2-1(0 + 2-1(210.5)))
=2 
-1 (1 + 2 
-1 (0 + 2 
-1 (1 + 0)))
(0.625)10 = (0.101)2

27
(178.6)10 = (B2.9)
? 16
(0.634)10 = (0.5044)
? 8
(maximum of four digits)

14
 An alternative method: (usu. for small values)
To break the number as the sum of numbers

that are equivalent to the binary place values
shown.
29
Introduction to Computer Science, Fall, 2010 B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008.
 An alternative method: (usu. for small values)
30
15
Binary-Hexadecimal Conversion
 four-bit grouping
(10011100010)2  (?)16
31
 Binary  Hex
(10011100010)2  (100 1110 0010)2  (4E2)16
 Hex  Binary
(24C)16  (0010 0100 1100)2  (1001001100)2
32
16
 Binary  Hex
(11010101011)2  (110 1010 1011)

? 2  (6AB)16
 Hex  Binary
(58F)16  (0101 1000 1111)2 ? (10110001111)2
33
Binary-Octal Conversion
 three-bit grouping
34
17
 Binary  Octal
(101110010)2  (101 110 010)2  (562)8
 Octal  Binary
(24)8  (010 100)2  (10100)2
35
 Binary  Octal
(11100110011)2  (011 100 110 011)

? 2  (3463)8
 Octal  Binary
(765)8  (111 110 101)2  (111110101)

? 2
36
18
Octal-Hex Conversion
 Convert with the aid of binary systems
37
Number of Digits
 Quiz:
Find the minimum number of binary digits

required to store decimal integers with a
maximum of six digits.
38
19
Number of Digits
 How can we know the number of digits

required to store a k-digit-base-b1 integral
value in the base-b2 system?
 Maximum k-digit value in base b1: (b1k –1)

Maximum x-digit value in base b2: (b2x –1)
(b2x –1) (b1k –1)  x k

(log b1 / log b2)
39
Number of Digits
 Quiz:
Find the minimum number of binary digits

required to store decimal integers with a
maximum of six digits.
k = 6, b1 = 10, b2 = 2.
x 6 (log b1 / log b2) = 6
(1/0.30103) = 19.9
 x = 20
219 = 524288
220 = 1048576
40
20
Non-positional Number System
 A non-positional number system still uses a limited
number of symbols in which each symbol has a
value.
 However, the position a symbol occupies in the

number normally bears no relation to its value—the
value of each symbol is fixed.
 To find the value of a number, we add the value of

all symbols present in the representation.
41

 In this system, a number is represented as:
and has the value of:
There are some exceptions to the addition rule we just mentioned, as shown in the
following example.
42
21
 Example: Roman numerals
43

 When a symbol with a smaller value is placed after a
symbol having an equal or larger value, the values
are added.
44
22

 When a symbol with a smaller value is placed before
a symbol having a larger value, the smaller value is
subtracted from the larger one.
45

 For other rules, please refer to the text book.
46
23
Summary
 Number systems
 Positional vs. Non-positional
 Positional systems
 Decimal
 Binary
conversion
 Octal
 Hexadecimal
 Non-positional systems
 Roman numeral
47
24

1 Number Systems

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1 Number Systems

Uploaded by

Copyright:

Available Formats

Number Systems

Instructor: Tsung-Che Chiang

Introduction to Computer Science, Fall, 2010

 Positional Number Systems

 A number system defines how a number can

 A number can be represented differently

Positional Number Systems

has the value of:

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 4

The Decimal System (base 10)

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 6

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 7

The Decimal System (base 10)

 Abacus –a device that uses positional

 The word binary is derived from the Latin root

The Binary System (base 2)

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 11

The Binary System (base 2)

 Chinese binary system

 The word hexadecimal is derived from the Greek

The Hexadecimal System (base 16)

 The word octal is derived from the Latin root octo

The Octal System (base 8)

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 16

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 17

Summary of the Four Positional

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 18

 We will introduce how to do the following

Conversion between Number Systems

 Decimal  Binary/Hex/Octal (Integral part)

B. Forouzan and F. Mosharraf,

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 22

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 23

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 24

 Decimal  Binary/Hex/Octal (Fractional part)

B. Forouzan and F. Mosharraf,

 Decimal  Binary/Hex/Octal (Fractional part)

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008.

 Decimal  Binary/Hex/Octal (Fractional part)

0.625 = 2-1(210.625) = 2-1 (1.25)

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008.

 Decimal  Binary/Hex/Octal (Fractional part)

B. Forouzan and F. Mosharraf, Foundations of Computer Science, 2nd ed., 2008. 28

To break the number as the sum of numbers

(10011100010)2  (100 1110 0010)2  (4E2)16

(24C)16  (0010 0100 1100)2  (1001001100)2

(11010101011)2  (110 1010 1011)

(58F)16  (0101 1000 1111)2 ? (10110001111)2

(101110010)2  (101 110 010)2  (562)8

(24)8  (010 100)2  (10100)2

(11100110011)2  (011 100 110 011)

(765)8  (111 110 101)2  (111110101)

 Convert with the aid of binary systems

Find the minimum number of binary digits

 How can we know the number of digits

 Maximum k-digit value in base b1: (b1k –1)

(b2x –1) (b1k –1)  x k

Find the minimum number of binary digits

 However, the position a symbol occupies in the

 To find the value of a number, we add the value of

Non-positional Number System

and has the value of:

 Example: Roman numerals

Non-positional Number System