MBA-111: ITM
Unit – 1
Number Systems
Two types of number systems are:
§ Non-positional number systems
§ Positional number systems
Non-positional 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
Positional Number Systems
§ Characteristics
§ Use only a few symbols called digits
§ These symbols represent different values depending
on the position they occupy in the number
Positional Number Systems
(Continued from previous slide..)
§ The value of each digit is determined by:
1. The digit itself
2. The position of the digit in the number
3. The base of the number system
(base = total number of digits in the number
system)
§ The maximum value of a single digit is
always equal to one less than the value of
the base
Decimal Number System
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
Decimal Number System
(Continued from previous slide..)
Example
258610 = (2 x 103) + (5 x 102) + (8 x 101) + (6 x 100)
= 2000 + 500 + 80 + 6
Binary Number System
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
Binary Number System
(Continued from previous slide..)
Example
101012 = (1 x 24) + (0 x 23) + (1 x 22) + (0 x 21) x (1 x 20)
= 16 + 0 + 4 + 0 + 1
= 2110
Representing Numbers in Different Number
Systems
In order to be specific about which number system we
are referring to, it is a common practice to indicate the
base as a subscript. Thus, we write:
101012 = 2110
Bit
§ Bit stands for binary digit
§ A bit in computer terminology means either a 0 or a 1
§ A binary number consisting of n bits is called an n-bit
number
Octal Number System
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)
Octal Number System
(Continued from previous slide..)
§ Since there are only 8 digits, 3 bits (23 = 8) are
sufficient to represent any octal number in binary
Example
20578 = (2 x 83) + (0 x 82) + (5 x 81) + (7 x 80)
= 1024 + 0 + 40 + 7
= 107110
Hexadecimal Number System
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)
Hexadecimal Number System
(Continued from previous slide..)
§ Each position of a digit represents a specific power
of the base (16)
§ Since there are only 16 digits, 4 bits (24 = 16) are
sufficient to represent any hexadecimal number in
binary
Example
1AF16 = (1 x 162) + (A x 161) + (F x 160)
= 1 x 256 + 10 x 16 + 15 x 1
= 256 + 160 + 15
= 43110
Converting a Number of Another Base to a
Decimal Number
Method
Step 1: Determine the column (positional) value of
each digit
Step 2: Multiply the obtained column values by the
digits in the corresponding columns
Step 3: Calculate the sum of these products
Converting a Number of Another Base to a
Decimal Number
(Continued from previous slide..)
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
Converting a Decimal Number to a Number of
Another Base
Division-Remainder Method
Step 1: Divide the decimal number to be converted by
the value of the new base
Step 2: Record the remainder from Step 1 as the
rightmost digit (least significant digit) of the
new base number
Step 3: Divide the quotient of the previous divide by the
new base
Converting a Decimal Number to a Number of
Another Base
(Continued from previous slide..)
Step 4: Record the remainder from Step 3 as the next
digit (to the left) of the new base number
Repeat Steps 3 and 4, recording remainders from right to
left, until the quotient becomes zero in Step 3
Note that the last remainder thus obtained will be the most
significant digit (MSD) of the new base number
Converting a Decimal Number to a Number of
Another Base
(Continued from previous slide..)
Example
95210 = ?8
Solution:
8 952 Remainder
119 s 0
14 7
1 6
0 1
Hence, 95210 = 16708
Converting a Number of Some Base to a Number
of Another Base
Method
Step 1: Convert the original number to a decimal
number (base 10)
Step 2: Convert the decimal number so obtained to
the new base number
Converting a Number of Some Base to a Number
of Another Base
(Continued from previous slide..)
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
Converting a Number of Some Base to a Number
of Another Base
(Continued from previous slide..)
Step 2: Convert 20910 to base 4
4 209 Remainders
52 1
13 0
3 1
0 3
Hence, 20910 = 31014
So, 5456 = 20910 = 31014
Thus, 5456 = 31014
Shortcut Method for Converting a Binary Number
to its Equivalent Octal Number
Method
Step 1: Divide the digits into groups of three starting
from the right
Step 2: Convert each group of three binary digits to
one octal digit using the method of binary to
decimal conversion
Shortcut Method for Converting a Binary Number
to its Equivalent Octal Number
(Continued from previous slide..)
Example
11010102 = ?8
Step 1: Divide the binary digits into groups of 3 starting
from right
001 101 010
Step 2: Convert each group into one octal digit
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
Hence, 11010102 = 1528
Shortcut Method for Converting an Octal
Number to Its Equivalent Binary Number
Method
Step 1: Convert each octal digit to a 3 digit binary
number (the octal digits may be treated as
decimal for this conversion)
Step 2: Combine all the resulting binary groups
(of 3 digits each) into a single binary
number
Shortcut Method for Converting an Octal
Number to Its Equivalent Binary Number
(Continued from previous slide..)
Example
5628 = ?2
Step 1: Convert each octal digit to 3 binary digits
58 = 1012, 68 = 1102, 28 = 0102
Step 2: Combine the binary groups
5628 = 101 110 010
5 6 2
Hence, 5628 = 1011100102
Shortcut Method for Converting a Binary
Number to its Equivalent Hexadecimal Number
Method
Step 1: Divide the binary digits into groups of four
starting from the right
Step 2: Combine each group of four binary digits to
one hexadecimal digit
Shortcut Method for Converting a Binary
Number to its Equivalent Hexadecimal Number
(Continued from previous slide..)
Example
1111012 = ?16
Step 1: Divide the binary digits into groups of four
starting from the right
0011 1101
Step 2: Convert each group into a hexadecimal digit
00112 = 0 x 23 + 0 x 22 + 1 x 21 + 1 x 20 = 310 = 316
11012 = 1 x 23 + 1 x 22 + 0 x 21 + 1 x 20 = 310 = D16
Hence, 1111012 = 3D16
Shortcut Method for Converting a Hexadecimal
Number to its Equivalent Binary Number
Method
Step 1: Convert the decimal equivalent of each
hexadecimal digit to a 4 digit binary
number
Step 2: Combine all the resulting binary groups
(of 4 digits each) in a single binary number
Shortcut Method for Converting a Hexadecimal
Number to its Equivalent Binary Number
(Continued from previous slide..)
Example
2AB16 = ?2
Step 1: Convert each hexadecimal digit to a 4 digit
binary number
216 = 210 = 00102
A16 = 1010 = 10102
B16 = 1110 = 10112
Shortcut Method for Converting a Hexadecimal
Number to its Equivalent Binary Number
(Continued from previous slide..)
Step 2: Combine the binary groups
2AB16 = 0010 1010 1011
2 A B
Hence, 2AB16 = 0010101010112
Fractional Numbers
Fractional numbers are formed same way as decimal
number system
In general, a number in a number system with base b
would be written as:
an an-1… a0 . a-1 a-2 … a-m
And would be interpreted to mean:
an x bn + an-1 x bn-1 + … + a0 x b0 + a-1 x b-1 + a-2 x b-2 +
… + a-m x b-m
The symbols an, an-1, …, a-m in above representation
should be one of the b symbols allowed in the number
system
Formation of Fractional Numbers in
Binary Number System (Example)
Binary Point
Position 4 3 2 1 0 . -1 -2 -3 -4
Position Value 24 23 22 21 20 2-1 2-2 2-3 2-4
Quantity 16 8 4 2 1 1/
2
1/
4
1/
8
1/
16
Represented
Formation of Fractional Numbers in
Binary Number System (Example)
(Continued from previous slide..)
Example
110.1012 = 1 x 22 + 1 x 21 + 0 x 20 + 1 x 2-1 + 0 x 2-2 + 1 x 2-3
= 4 + 2 + 0 + 0.5 + 0 + 0.125
= 6.62510
Formation of Fractional Numbers in
Octal Number System (Example)
Octal Point
Position 3 2 1 0 . -1 -2 -3
Position Value 83 82 81 80 8-1 8-2 8-3
Quantity 512 64 8 1 1/
8
1/
64
1/
512
Represented
Formation of Fractional Numbers in
Octal Number System (Example)
(Continued from previous slide..)
Example
127.548 = 1 x 82 + 2 x 81 + 7 x 80 + 5 x 8-1 + 4 x 8-2
= 64 + 16 + 7 + 5/8 + 4/64
= 87 + 0.625 + 0.0625
= 87.687510
Binary Arithmetic
§ Binary arithmetic is simple to learn as binary number
system has only two digits – 0 and 1
§ Following slides show rules and example for the four
basic arithmetic operations using binary numbers
Binary Addition
Rule for binary addition is as follows:
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 0 plus a carry of 1 to next higher column
Binary Addition (Example 1)
Example
Add binary numbers 10011 and 1001 in both decimal and
binary form
Solution
Binary Decimal
carry 11 carry 1
10011 19
+1001 +9
11100 28
In this example, carry are generated for first and second columns
Binary Addition (Example 2)
Example
Add binary numbers 100111 and 11011 in both decimal
and binary form
Solution
The addition of three 1s
Binary Decimal can be broken up into two
steps. First, we add only
carry 11111 carry 1 two 1s giving 10 (1 + 1 =
10). The third 1 is now
100111 39
added to this result to
+11011 +27 obtain 11 (a 1 sum with a 1
carry). Hence, 1 + 1 + 1 =
1000010 66 1, plus a carry of 1 to next
higher column.
Binary Subtraction
Rule for binary subtraction is as follows:
0 - 0 = 0
0 - 1 = 1 with a borrow from the next column
1 - 0 = 1
1 - 1 = 0
Binary Subtraction (Example)
Example
Subtract 011102 from 101012
Solution
12
0202
10101
-01110
00111
Note: Go through explanation given in the book
Complement of a Number
Number of digits
in the number
C = Bn - 1 - N
Complement Base of the The number
of the number number
Complement of a Number (Example 1)
Example
Find the complement of 3710
Solution
Since the number has 2 digits and the value of
base is 10,
(Base)n - 1 = 102 - 1 = 99
Now 99 - 37 = 62
Hence, complement of 3710 = 6210
Complement of a Number (Example 2)
Example
Find the complement of 68
Solution
Since the number has 1 digit and the value of
base is 8,
(Base)n - 1 = 81 - 1 = 710 = 78
Now 78 - 68 = 18
Hence, complement of 68 = 18
Complement of a Binary Number
Complement of a binary number can be obtained by
transforming all its 0’s to 1’s and all its 1’s to 0’s
Example
Complement of 1 0 1 1 0 1 0 is
0 1 0 0 1 0 1
Note: Verify by conventional complement
Complementary Method of Subtraction
Involves following 3 steps:
Step 1: Find the complement of the number you
are subtracting (subtrahend)
Step 2: Add this to the number from which you
are taking away (minuend)
Step 3: If there is a carry of 1, add it to obtain
the result; if there is no carry, recomplement the
sum and attach a negative sign
Complementary subtraction is an additive approach of subtraction
Complementary Subtraction (Example 1)
Example:
Subtract 5610 from 9210 using complementary method.
Solution
Step 1: Complement of 5610
= 102 - 1 - 56 = 99 – 56 = 4310 The result may be
verified using the
Step 2: 92 + 43 (complement of 56) method of normal
= 135 (note 1 as carry) subtraction:
Step 3: 35 + 1 (add 1 carry to sum) 92 - 56 = 36
Result = 36
Complementary Subtraction (Example 2)
Example
Subtract 3510 from 1810 using complementary method.
Solution
Step 1: Complement of 3510 Step 3: Since there is no carry,
= 102 - 1 - 35 re-complement the sum and
= 99 - 35 attach a negative sign to
= 6410 obtain the result.
Result = -(99 - 82)
Step 2: 18 = -17
+ 64 (complement
of 35) The result may be verified using normal
82 subtraction:
18 - 35 = -17
Binary Subtraction Using Complementary Method
(Example 1)
Example
Subtract 01110002 (5610) from 10111002 (9210) using
complementary method.
Solution
1011100
+1000111 (complement of 0111000)
10100011
1 (add the carry of 1)
0100100
Result = 01001002 = 3610
Binary Subtraction Using Complementary Method
(Example 2)
Example
Subtract 1000112 (3510) from 0100102 (1810) using
complementary method.
Solution
010010
+011100 (complement of 100011)
101110
Since there is no carry, we have to complement the sum and
attach a negative sign to it. Hence,
Result = -0100012 (complement of 1011102)
= -1710
Binary Multiplication
Table for binary multiplication is as follows:
0x0=0
0x1=0
1x0=0
1x1=1
Binary Multiplication (Example 1)
Example
Multiply the binary numbers 1010 and 1001
Solution
1010 Multiplicand
x1001 Multiplier
1010 Partial Product
0000 Partial Product
0000 Partial Product
1010 Partial Product
1011010 Final Product
Binary Multiplication (Example 2)
(Continued from previous slide..)
Whenever a 0 appears in the multiplier, a separate partial
product consisting of a string of zeros need not be generated
(only a shift will do). Hence,
1010
x1001
1010
1010SS (S = left shift)
1011010
Binary Division
Table for binary division is as follows:
0 ÷ 0 = Divide by zero error
0 ÷ 1 = 0
1 ÷ 0 = Divide by zero error
1 ÷ 1 = 1
As in the decimal number system (or in any other number
system), division by zero is meaningless
The computer deals with this problem by raising an error
condition called ‘Divide by zero’ error
Rules for Binary Division
1. Start from the left of the dividend
2. Perform a series of subtractions in which the divisor is
subtracted from the dividend
3. If subtraction is possible, put a 1 in the quotient and
subtract the divisor from the corresponding digits of
dividend
4. If subtraction is not possible (divisor greater than
remainder), record a 0 in the quotient
5. Bring down the next digit to add to the remainder
digits. Proceed as before in a manner similar to long
division
Binary Division (Example 1)
Example
Divide 1000012 by 1102
Solution 0101 (Quotient)
110 100001 (Dividend)
110 1 Divisor greater than 100, so put 0 in quotient
1000 2 Add digit from dividend to group used above
110 3 Subtraction possible, so put 1 in quotient
100 4 Remainder from subtraction plus digit from dividend
110 5 Divisor greater, so put 0 in quotient
1001 6 Add digit from dividend to group
110 7 Subtraction possible, so put 1 in quotient
11 Remainder
Additive Method of Multiplication and Division
Most computers use the additive method for performing
multiplication and division operations because it simplifies
the internal circuit design of computer systems
Example
4 x 8 = 8 + 8 + 8 + 8 = 32
Rules for Additive Method of Division
§ Subtract the divisor repeatedly from the dividend until
the result of subtraction becomes less than or equal to
zero
§ If result of subtraction is zero, then:
§ quotient = total number of times subtraction was
performed
§ remainder = 0
§ If result of subtraction is less than zero, then:
§ quotient = total number of times subtraction was
performed minus 1
§ remainder = result of the subtraction previous to
the last subtraction
Additive Method of Division (Example)
Example
Divide 3310 by 610 using the method of addition
Solution:
33 - 6 = 27
27 - 6 = 21 Since the result of the last
21 - 6 = 15 subtraction is less than zero,
15 - 6 = 9
9-6= 3 Quotient = 6 - 1 (ignore last
3 - 6 = -3 subtraction) = 5
Total subtractions = 6 Remainder = 3 (result of previous
subtraction)
