Chapter03 - Number System
Chapter03 - Number System
Chapter03 - Number System
Computer Fundamentals:
Fundamentals: Pradeep
Pradeep K.
K. Sinha
Sinha &
& Priti
Priti Sinha
Sinha
Learning Objectives
Learning Objectives
(Continued from previous slide..)
Number Systems
§ Characteristics
§ Use symbols such as I for 1, II for 2, III for 3, IIII
for 4, IIIII for 5, etc
§ Each symbol represents the same value regardless
of its position in the number
§ The symbols are simply added to find out the value
of a particular number
§ Difficulty
§ It is difficult to perform arithmetic with such a
number system
§ Characteristics
Characteristics
§ A positional number system
§ Has 10 symbols or digits (0, 1, 2, 3, 4, 5, 6, 7,
8, 9). Hence, its base = 10
§ The maximum value of a single digit is 9 (one
less than the value of the base)
§ Each position of a digit represents a specific
power of the base (10)
§ We use this number system in our day-to-day
life
Example
= 2000 + 500 + 80 + 6
Characteristics
§ A positional number system
§ Has only 2 symbols or digits (0 and 1). Hence its
base = 2
§ The maximum value of a single digit is 1 (one less
than the value of the base)
§ Each position of a digit represents a specific power
of the base (2)
§ This number system is used in computers
Example
= 16 + 0 + 4 + 0 + 1
= 2110
101012 = 2110
Bit
Characteristics
§ A positional number system
§ Has total 8 symbols or digits (0, 1, 2, 3, 4, 5, 6, 7).
Hence, its base = 8
§ The maximum value of a single digit is 7 (one less
than the value of the base
§ Each position of a digit represents a specific power of
the base (8)
Example
= 1024 + 0 + 40 + 7
= 107110
Characteristics
§ A positional number system
§ Has total 16 symbols or digits (0, 1, 2, 3, 4, 5, 6, 7,
8, 9, A, B, C, D, E, F). Hence its base = 16
§ The symbols A, B, C, D, E and F represent the
decimal values 10, 11, 12, 13, 14 and 15
respectively
§ The maximum value of a single digit is 15 (one less
than the value of the base)
Example
1AF16 = (1 x 162) + (A x 161) + (F x 160)
= 1 x 256 + 10 x 16 + 15 x 1
= 256 + 160 + 15
= 43110
Method
Example
47068 = ?10
Common
values
multiplied
47068 = 4 x 83 + 7 x 82 + 0 x 81 + 6 x 80 by the
corresponding
= 4 x 512 + 7 x 64 + 0 + 6 x 1 digits
= 2048 + 448 + 0 + 6 Sum of these
products
= 250210
Division-Remainder Method
Step 1: Divide the decimal number to be converted by
the value of the new base
Note that the last remainder thus obtained will be the most
significant digit (MSD) of the new base number
Example
95210 = ?8
Solution:
8 952 Remainder
119 s 0
14 7
1 6
0 1
Method
Example
5456 = ?4
Solution:
Step 1: Convert from base 6 to base 10
5456 = 5 x 62 + 4 x 61 + 5 x 60
= 5 x 36 + 4 x 6 + 5 x 1
= 180 + 24 + 5
= 20910
4 209 Remainders
52 1
13 0
3 1
0 3
Method
Step 1: Divide the digits into groups of three starting
from the right
Example
11010102 = ?8
0012 = 0 x 22 + 0 x 21 + 1 x 20 = 1
1012 = 1 x 22 + 0 x 21 + 1 x 20 = 5
0102 = 0 x 22 + 1 x 21 + 0 x 20 = 2
Method
Step 1: Convert each octal digit to a 3 digit binary
number (the octal digits may be treated as
decimal for this conversion)
Example
5628 = ?2
Method
Example
1111012 = ?16
0011 1101
Method
Example
2AB16 = ?2
Fractional Numbers
Binary Point
Position 4 3 2 1 0 . -1 -2 -3 -4
Quantity 16 8 4 2 1 1/
2
1/
4
1/
8
1/
16
Represented
Example
Octal Point
Position 3 2 1 0 . -1 -2 -3
Quantity 512 64 8 1 1/
8
1/
64
1/
512
Represented
Example
Key Words/Phrases