NUMBER SYSTEM
• NUMBER SYSTMS ARE THE WAYS OF REPRESENTING NUMBERS IN DIFFERENT FORMS.
• EACH NUMBER SYSTEM INVOLVES A DEFINITE SET OF DIGITS WHILE WRITING A NUMBER.
IT IS KNOWN AS THE BASE OF THE NUMBER.
• EXAMPLE: A NUMBER WITH BASE 5 WILL HAVE ONLY 5 DIGITS 0, 1, 2, 3, 4
• TYPES OF NUMBER SYSTEMS:
• DECIMAL NUMBER SYSTEM (BASE 10)
• OCTAL NUMBER SYSTEM (BASE 8)
• HEXADECIMAL NUMBER SYSTEM (BASE 16)
• BINARY NUMBER SYSTEM (BASE 2)
DECIMAL NUMBER SYSTEM
• BASE IS 10
• DIGITS ARE: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
• THE PLACE VALUE PROGRESSES IN MULTIPLE OF 10
• EXAMPLE:
10^3 10^2 10^1 10^0
1000 100 10 1
3 7 6 8
• NUMBER SYSTEM
0 1 2 3 4 5 6 7 8 9
10 11 12 13 14 15 16 17 18 19
20 21 22 23 24 25 26 27 28 29
AND SO ON…….
OCTAL NUMBER SYSTEM
• BASE IS 8
• DIGITS ARE 0, 1, 2, 3, 4, 5, 6, 7
[NOTE: THERE IS NO SUCH DIGITS AS 8 & 9]
• THE PLACE VALUES ARE IN MULTIPLES OF 8
• EXAMPLE:
8^2 8^1 8^0
64 8 1
3 4 6
• NUMBER SYSTEM
0 1 2 3 4 5 6 7
10 11 12 13 14 15 16 17
20 21 22 23 24 25 26 27
:
70 71 72 73 74 75 76 77
100 101 102 103 104 105 106 107
AND SO ON……
HEXADECIMAL NUMBER SYSTEM
• BASE IS 16
• DIGITS ARE: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F
• THE PLACE VALUES ARE IN MULTIPLES OF 16
• EXAMPLE
16^2 16^1 16^0
256 16 1
1 3 5
• NUMBER SYSTEM
0 1 2 3 4 5 6 7 8 9 A B C D E F
10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F
20…………………………………………………………………………………………2F
30…………………………………………………………………………………………3F
:
90…………………………………………………………………………………………9F
A0………………………………………………………………………………………..AF
:
F0………………………………………………………………………………………… FF
BINARY NUMBER SYSTEM
• BASE IS 2
• DIGITS ARE: 0,1
• PLACE VALUES ARE IN MULTIPLES OF 2
• EXAMPLE
2^3 2^2 2^1 2^0
8 4 2 1
1 0 1 1
• NUMBER SYSTEM
0 1
10 11
100 101 110 111
1000 1001 1010 1101 1100 1101 1110 1111
DECIMAL TO BINARY CONVERSION
CONVERT (24)10 TO (?)2 CONVERT (125)10 TO (?)2
2 24 2 125
2 12 0 2 62 1
2 6 0 2 31 0
2 3 0 2 15 1
2 1 1 2 7 1
0 1 2 3 1
2 1 1
0 1
(24)10 = (11000)2 (125)10 = (1111101)2
• CONVERT (85.27)10 TO (?)2
INTEGRAL PART CONVERSION FRACTIONAL PART CONVERSION
85 0.27 x 2 = 0.54 0
2 42 1 0.54 x 2 = 1.08 1
2 21 0 0.08 x 2 = 0.16 0
2 10 1 0.16 x 2 = 0.32 0
2 5 0 0.32 x 2 = 0.64 0
2 2 1 0.64 x 2 = 1.28 1
2 1 0 0.28 x 2 = 0.56 0
2 0 1 0.56 x 2 = 1.12 1
(85.27)10 = (1010101.01000101)2
DECIMAL TO OCTAL CONVERSION
• CONVERT (395)10 TO (?)8 CONVERT (770.375)10 TO (?)8
INTEGRAL PART FRACTIONAL PART
395
8 49 3 770 0.375 x 8 = 3.000
8 6 1 8 96 2
0 6 8 12 0
8 1 4
8 0 1
(395)10 = (613)8 ( 770.375)10 = (1402.3)8
DECIMAL TO HEXADECIMAL CONVERSION
• CONVERT (2699)10 TO (?)16 CONVERT (58823.25)10 TO (?)16
INTEGRAL PART FRACTIONAL PART
2699
16 168 11 (B) 58823 0.25 x 16 = 4.00
16 10 8 16 3676 7
16 0 16 (A) 16 229 12 (C)
16 14 5
16 0 14 (E)
(2699)10 = (A8B)16 (58823.25)10 = (E5C7.4)16
BINARY TO DECIMAL CONVERSION
CONVERT (1011010)2 TO (?)10
= (1 x 26) + (0 x 25) + (1 x 24) + (1 x 23) + (0 x 22) + (1 x 21) + (0 x20)
= 64 + 0 + 16 + 8 + 0 + 2 + 0
= 90
(1011010)2 = (90)10
CONVERT (101110110.111)2 TO (?)10
INTEGRAL PART CONVERSION
= (1 X 28) + (0 X 27) + (1 X 26) + (1 x 25) + (1 x 24) + (0 x 23) + (1 x 22) + (1 x 21) + (0 x 20)
= 256 + 0 + 64 + 32 + 16 + 0 + 4 + 2 + 0
= 374
FRACTIONAL PART CONVERSION
= (1 x 2-1) + (1 x 2-2) + (1 x 2-3)
= 0.5 + 0.25 + 0.125
= 0.875
(101110110.111)2 = (374.875)10
BINARY TO OCTAL CONVERSION
CONVERT (11001011011)2 TO (?)8
MAKE A GROUP OF 3 BITS FROM THE RIGHT CONVERSION TABLE
1 1 0 0 1 0 1 1 1 0 1 1 NO 4 2 1
WRITE THE PLACE VALUE ON TOP OF EACH GROUP 0 0 0 0
1 0 0 1
4 2 1 4 2 1 4 2 1 4 2 1
2 0 1 0
1 1 0 0 1 0 1 1 1 0 1 1
3 0 1 1
6 2 7 3
CONVERT (110011.111)2 TO (?)8 4 1 0 0
5 1 0 1
4 21 4 21 . 4 2 1 6 1 1 0
110 0 11 . 1 1 1 7 1 1 1
6 3 . 7
BINARY TO HRXADECIMAL CONVERSION
CONVERT (1110101101001.1010)2 TO (?)16
NO 8 4 2 1
0 0 0 0 0
1. MAKE A GROUP OF 4 BITS FROM RIGHT. 1 0 0 0 1
2. WRITE THE PLACE VALUES ON TOP OF EACH BIT. 2 0 0 1 0
3 0 0 1 1
1 8 4 2 1 8 4 2 1 8 4 2 1 . 8 4 2 1 4 0 1 0 0
5 0 1 0 1
1 11 01 0110 1001 . 1 0 1 0 6 0 1 1 0
1 13 6 9 . 10 7 0 1 1 1
8 1 0 0 0
1 D 6 9 . A
9 1 0 0 1
A 1 0 1 0
B 1 0 1 1
C 1 1 0 0
D 1 1 0 1
E 1 1 1 0
F 1 1 1 1
OCTAL TO DECIMAL CONVERSION
• CONVERT (345.25)8 TO (?)10
CONVERSION OF INTEGRAL PART
= (3 x 82) + (4 x 81) + (5 x 80)
= (3 x 64) + (4 x 8) + (5 x 1)
= 192 + 32 + 5
= 229
CONVERSION OF FRACTIONAL PART
= (2 x 8-1) + (5 x 8-2)
= (2 x 1/8) + (5 x 1/64)
= (2 x 0.125) + (5 x 0.0156)
= 0.25 + 0.078
= 0.328
(345.25)8 = (229.328)10
OCTAL TO BINARY CONVERSION
• CONVERT (567.75)8 TO (?)2
WRITE THE BINARY OF EACH DIGIT OCTAL TO BINARY TABLE
5 6 7 . 7 5
101 110 111 . 111 101
(567.75)8 = (101110111.111101)2
HEXADECIMAL TO DECIMAL CONVERSION
• CONVERT (34AC.25)16 TO (?)10
CONVERSION OF INTEGRAL PART
= (3 x 163) + (4 x 162) + (10 x 161) + (12 x 160)
= (3 x 4096) + (4 x 256) + (10 x 16) + (12 x 1)
= (12288) + (1024) + (160) + (12)
= 13484
CONVERSION OF FRACTIONAL PART
= (2 x 16-1) + ( 5 x 16-2)
= (2 x 1/16) + (5 x 1/256)
= (2 x 0.0625) + ( 5 x 0.0039)
= 0.125 + 0.0195
= 0.1445
(34AC.25)16 = (13484.1445)10
HEXADECIMAL TO BINARY CONVERSION
• CONVERT ([Link])16 TO (?)2 NO 8 4 2 1
0 0 0 0 0
WRITE THE BINARY OF EACH DIGIT 1 0 0 0 1
2 0 0 1 0
3 0 0 1 1
F A C E . A B 4 0 1 0 0
1111 1010 1100 1110 . 1010 1011 5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
([Link])16 = (1111101011001110.10101011)2 9 1 0 0 1
A 1 0 1 0
B 1 0 1 1
C 1 1 0 0
D 1 1 0 1
E 1 1 1 0
F 1 1 1 1
BINARY ARITHMETIC
BINARY ADDITION
• RULES FOR ADDITION
0+0=0
0+1=1
1+0=1
1 + 1 = 10 (SUM = 0 CARRY = 0)
ADD (11011.11)2 AND (10110.10)2
CARRY 1 1 1 1 1
1 1 0 1 1 . 1 1
1 0 1 1 0 . 1 0
-------------------------------------------------------------
1 1 0 0 1 0 . 0 1
(11011.11)2 + (10110.10)2 = (110010.01)2
BINARY SUBTRACTION
RULES FOR SUBTRACTION
0–0=0
1–0=1
1–1=0
0 – 1 = 1 BORROW 1 DIFFERENCE
• UNDERSTANDING THE CONCEPT OF BORROW IN BINARY SUBTRACTION
SUBTRACT (10)2 – (01)2 SUBTRACT (100)2 – (001)2
1 BORROWED FROM LEFT
1 BORROWED FROM LEFT 1 BORROWED FROM LEFT
1
10 [10 = 1 + 1 ] 10 10
1 0 1 0 0 1
0 1 0 0 1
------------ ---------------------------
0 1 0 1 1
BINARY MULTIPLICATION
• RULES FOR MULTIPLICATION
0 X 0 = 0
1 X 0 = 0
1 X 1 = 1
MULTIPLY (10101)2 X (101)2
1 0 1 0 1
x 1 0 1
----------------------------------------------
CARRY 1 1
1 0 1 0 1
0 0 0 0 0 x
1 0 1 0 1 x x
-------------------------------------------------------
1 1 0 1 0 0 1
-------------------------------------------------------
[NOTE: ADDITION IS AS PER BINARY ADDITION RULES]
BINARY DIVISION
• DIVIDE 10110 101
100 QUOTIENT
101 | 10110
101
10 REMAINDER
[NOTE: SUBTRACTION IS AS PER BINARY SUBTRACTION RULES]
REPRESENTATION OF NEGATIVE NUMBERS IN
BINARY NUMBER SYSTEM
• SIGN MAGNITUDE METHOD
REPRESENTATION OF +VE NUMBER
SIGN BIT
+9 = 0 000 1001 [8 BIT REPRESENTATION]
+9 = 0, 1 0 0 1
REPRESENTATION OF –VE NUMBER
SIGN BIT
-9 = 1 0 0 0 1 0 0 1 [8 BIT REPRESENTATION]
-9 = 1, 1001
1’S COMPLEMENT METHOD TO REPRESENT –VE NUMBER
REPRESENTATION OF +15 AND -15 IN BINARY FORM
+15 = 0 000 1111 [8 BIT REPRESENTATION]
-15 = 1 111 0000 [8 BIT REPRESENTATION]
(1’S COMPLEMENT FORM)
[ NOTE: TO OBTAIN 1’S COMPLEMENT, TOGGLE 0 & 1 ]
2’S COMPLEMENT METHOD TO REPRESENT –VE NUMBER
REPRESENTATION OF +15 AND -15 IN BINARY FORM
+15 = 0 000 1111 [8 BIT REPRESENTATION OF +15 ]
-15 = 1 111 0000 [ 8-BIT 1’S COMPLEMENT FORM OF -15 ]
+ 1
---------------------------
-15 = 1 111 0001 [ 8-BIT 2’S COMPLEMENT FORM OF -15 ]
[ NOTE: TO OBTAIN 2’S COMPLEMENT, ADD 1 TO THE 1’S COMPLEMENT FORM ]
BINARY SUBTRACTION USING 1’S COMPLEMENT
• CASE 1 : ADDING A POSITIVE AND A NEGATIVE NUMBER
ADD +7 AND -3 [ 7 – 3 = 7 + (-3) ]
+7 = 0000 0111
+3 = 0000 0011
-3 = 1111 1100 [IN 1’S COMPLEMENT FORM]
ADDITION OF +7 AND -3
1111 1
+7 0000 0111
-3 1111 1100
---- --------------------
+4 1 0 0 0 0 0 0 1 1
+ 1 [END AROUND CARRY – EXTRA BIT IS BROUGHT DOWN & ADDED]
------------------------
0000 0 100 [+4 IN BINARY]
• CASE 2 : ADDING A NEGATIVE AND A POSITIVE NUMBER
ADD -7 AND +3
+7 = 0000 0111
-7 = 1111 1000 [IN 1’S COMPLEMENT FORM]
+3 = 0000 0011
ADDITION OF -7 AND +3
-7 1111 1000
+3 0000 0011
---- --------------------
-4 1111 1011
VERIFICATION: +4 = 0000 0100
-4 = 1111 1011
• CASE 3 : ADDING TWO NEGATIVE NUMBERS
ADD -7 AND -3
+7 = 0000 0111
-7 = 1111 1000 [IN 1’S COMPLEMENT FORM]
+3 = 0000 0011
-3 = 1111 1100 [IN 1’S COMPLEMENT FORM]
ADDITION OF -7 AND -3
-7 1111 1000
-3 1111 1100
---- --------------------
-10 11 1 1 1 0 1 0 0
+1 VERIFICATION: +10 = 0000 1010
----------------------- -10 = 1111 0101
1111 0 10 1
BINARY SUBTRACTION USING 2’S COMPLEMENT
• CASE 1 : ADDING A POSITIVE AND A NEGATIVE NUMBER
ADD +7 AND -3 [ 7 – 3 = 7 + (-3) ]
+7 = 0000 0111
+3 = 0000 0011
-3 = 1111 1100 [IN 1’S COMPLEMENT FORM]
-3 = 1111 1101 [IN 2’S COMPLEMENT FORM]
ADDITION OF +7 AND -3
1111 111
+7 0 0 0 0 0 1 1 1
-3 1111 1101
---- --------------------
+4 1 0 0 0 0 0 1 0 0 [ IGNORE EXTRA BIT ]
------------------------
0000 0100 [+4 IN BINARY]
• CASE 2 : ADDING A NEGATIVE AND A POSITIVE NUMBER
ADD -7 AND +3
+7 = 0000 0111
-7 = 1111 1000 [IN 1’S COMPLEMENT FORM]
-7 = 1111 1001 [IN 2’S COMPLEMENT FORM]
+3 = 0000 0011
ADDITION OF -7 AND +3
11
-7 1111 1001
+3 0000 0011
---- --------------------
-4 1111 1100
VERIFICATION: +4 = 0000 0100
-4 = 1111 1011 [ 1’ S C]
-4 = 1111 1100 [ 2 ’S C]
• CASE 3 : ADDING TWO NEGATIVE NUMBERS
ADD -7 AND -3
+7 = 0000 0111 +3 = 0000 0011
-7 = 1111 1000 [1’S COMPLEMENT FORM] -3 = 1111 1100
-7 = 1111 1001 [2’S COMPLEMENT FORM] -3 = 1111 1101
ADDITION OF -7 AND -3
1111 1
-7 1111 1001
-3 1111 1101
---- --------------------
-10 11 1 1 1 0 1 1 0 [IGNORE THE EXTRA BIT]
VERIFICATION: +10 = 0000 1010
-10 = 1111 0101 [IN 1’S C]
-10 = 1111 0110 [IN 2’S C]
OCTAL ARITHMETIC
• OCTAL ADDITION
ADD (1476)8 + (4454)8
CARRY 1 1 1
1 4 7 6
4 4 5 4
---------------------------
6 1 5 2 ----ROUGH----
OCTAL NUMBER SYSTEM 6 + 4 = 10 -> 12
0 1 2 3 4 5 6 7 1+7+5 = 13 -> 15
10 11 12 13 14 15 16 17 1+4+4 = 9 -> 11
20 21 22 23 24 25 26 27
OCTAL SUBTRACTION USING 8’S COMPLEMENT
HOW TO FIND THE 8’S COMPLEMENT OF OCTAL NUMBER
• FIND THE 8’S COMPLEMENT OF OCTAL NUMBER 647
STEP 1: SUBTRACT THE DIGITS FROM ALL 7
7 7 7
6 4 7
----------------------
1 3 0 [7’S COMPLEMENT]
STEP 2: ADD 1 TO THE ABOVE 7’S COMPLEMENTS
1 3 0
+ 1
----------------------
1 3 1 [8’S COMPLEMENT]
• SUBTRACT OCTAL NUMBER 567 FROM 745 USING 8’S COMPLEMENT
STEP 1: FIND THE COMPLEMENT OF OCTAL 567
7 7 7
- 5 6 7
---------------------------
2 1 0 [7’S COMPLEMENT]
+ 1
---------------------------
2 1 1 [8’S COMPLEMENT]
STEP 2: ADD 745 AND 211
7 4 5
2 1 1
----------------------
1 1 5 6 [DROP THE CARRY]
HEXADECIMAL ARITHMETIC
• ADD (1CFD)16 AND (1AA0)16
CARRY 1 1
1 C F D
1 A A 0
----------------------------
3 7 9 D
HEXADECIMAL NUMBER SYSTEM __ROUGH__
0 1 2 3 4 5 6 7 8 9 A B C D E F D+0=D
10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F F + A = 25 -> 19
20 21 22 23 24 25 26 27 28 29 2A 2B 2C 2D 2E 2F 1+C+A = 23 -> 17
1+1+1 = 3
HEXADECIMAL SUBTRACTION USING 16’S COMPLEMENT
HOW TO FIND 16’S COMPLEMENT OF A HEXADECIMAL NUMBER
• FIND 16’S COMPLEMENT OF 2A7
STEP 1: SUBTRACT THE NUMBER FROM ALL F
F F F
2 A 7
---------------------
D 5 8 [15’S COMPLEMENT]
STEP 2: ADD 1 TO THE ABOVE 15’S COMPLEMENT
D 5 8
+ 1
-----------------------
D 5 9 [16’S COMPLEMENT]
• CALCULATE (1E5)16 – (177)16
STEP 1 : FIND THE 16’S COMPLEMENT OF 177
F F F
- 1 7 7
--------------------------
E 8 8 [15’S COMPLEMENT]
+ 1
--------------------------
E 8 9 [16’S COMPLEMENT]
STEP 2: ADD (1E5) AND (E89)
1 E 5
E 8 9
--------------------------
10 6 E [DROP THE CARRY]