Number Systems: By: Miss. Chrisna L. Fucio
Number Systems: By: Miss. Chrisna L. Fucio
Number Systems: By: Miss. Chrisna L. Fucio
736.258
= 7x102 + 3x101 + 6x100 + 5x10-1 + 2x10-2 + 2x10-3
= 7x100 + 3x10 + 6x1 + 5/10 + 2/100 + 8/1000
Scientific notation provides a convenient
scheme for representation of such quantities.
a. Rounding Down
Ex.Original Number: 124.244 138.563
Rounded Off: 124.24 138.56
b. Rounded Off
Ex.Original Number: 1.395 26.175
Rounded Off: 1.40 26.18
c. Rounding Up
Ex.Original Number: 26.276 566.666
Rounded Off: 26.28 566.67
Suppose that one simply deletes the digits
after a certain digit rather than rounding off
the number. This process is called truncating
or chopping
Ex.
Original Number: 88.76 246.8 178.9587
Rounded Off: 88 246 178
In the computer, data is recorded as
electronic signals or indications. The presence
or absence of these signals in specific circuitry
represents data in the computer just as the
presence or absence of punched holes
represents data on a punched card.
Example:
a. 101 = 1x22 + 0x21 + 1x20
= 4+0+1
= 5
0.2x2=0.4 0
0.4x2=0.8 0
0.8x2=1.6 1
…….
Example:
Converting the decimal number 24.625 to its binary
equivalent
Example
BINARY DECIMAL
110011 51
- 11101 - 29
? 22
Solution
Example:
a) BINARY
110011
+ 00010 (complement of the subtrahend 11101)
110101 (binary sum)
+ 1 (end – around carry)
10110 (answer)
b) BINARY DECIMAL
1100.01 12.25
- 1010.10 - 10.50
? 1.75
Solution using ones complement
1100.01
+0101.01 (complement of the subtrahend 1010.10)
10001.10 (binary sum)
+ 1 (end-around carry)
1.11 (answer)
The rule for decimal multiplication also holds
for binary multiplication. It is simpler since
multiplying numbers by the bit 0 or 1 yields
respectively 0 or 1 the number.
Multiplication consists of adding a number to
itself as many times as is specified by the
multiplier
The binary multiplication table is
0x0=0 0x1=0
1x0=0 1x1=1
Example:
a) BINARY DECIMAL
111 (multiplicand) 7
x 101 (multiplier) x 5
111 (1st partial product) 35
000 (2nd partial product)
111 (3rd partial product)
100011 (column sums yield the answer)
Example:
b) BINARY DECIMAL
11.00 3.0
x 10.10 x 2.5
0000 150
1100 60
0000 7.5
1100
111.1000 (answer)
Binary Division is a very simple process.
Division is inverse of multiplication and division
by zero is similarly meaningless.
The complete table for binary division is
0/1 = 0 1/1 = 1
Example:
a) BINARY DECIMAL
12/4 = 3
The above problem could be also solved by
the process of repeated subtraction.
BINARY DECIMAL
1100 12/4 = 3
- 100 (1st subtraction)
1000
- 100 (2nd subtraction)
100
100 (3rd subtraction) Therefore:
000 11002/1002 = 112
The octal number system was adapted
because of the difficulty of dealing with long
strings of binary 0’s and 1’s in converting them
into decimals.
Example:
Multiplication Carry Over
0.2575x8 = 2.06 2
0.06 x 8 = 0.48 0
0.48 x 8 = 3.84 3
0.84 x 8 = 6.72 6
0.72 x 8 = 5.75 5
Therefore: 0.257510 = 0.203658
Example
a. 458 = ?2
since: 48 = 1002
and 58 = 1012
b. 124.578 = ?2
since: 18 = 0012 , 28 = 0102 , 48 = 1002
58 = 1012, and 78 = 1112
Converting from binary to octal is the reverse
of the procedure
a. 101101112 = ? 8
Grouping the bits into three:
1011011112 = 010 110 1112 or 2678
b. 1011.011012 = ? 8
Grouping the bits into three:
1011. 01101 = 001 011.011 1012 or 13.328
a. DIVISION REMAINDERS
58/16 = 3 10 (or A) therefore:
3/16 = 0 3 5810 = 3A16
b. DIVISION REMAINDERS
362/16 = 22 10 (or A) therefore:
22/16 = 1 6 36210 = 16A16
1/16 = 0 1
One way is to convert from hexadecimal to
binary and then decimal.
b. 4139.B88
= 4x163 + 1x162 + 3x161 + 9x160 +11x16-1 + 8x16-2
= 16384 + 256 + 48 + 9 + 0.6875 + 0.03125
= 16697.7187510
The conversion from hexadecimal to binary is a
simple procedure and easily done is replacing
each hexadecimal digit by its 4-bit equivalent.
a. 2C8516 = ?2
since: 216 = 00102 ,, C16 = 11002 , 816 = 10002
, and 516 = 01012
therefore 2C8516 = 0010 1100 1000 01012
b. 8A.5B16 = ?2
since: 816 = 10002 ,A16 = 10102 ,
516 = 01012 , B16 = 10112
therefore 8A.5B16 = 1000 1010 . 010110112
Converting from binary to hexadecimal is the
reverse of the procedure
a. 1011101100100112 = ? 16
Grouping the bits into four:
1011101100100112
= 0101 1101 1001 00112 or 5D9316
b. 110001010.011011102 = ? 16
Grouping the bits into four:
110001010.01101110
=0001 1000 1010.0110 11102 or 18A.6E16
Hexadecimal Number Binary Number
0 0000
1 0001
2 0010
3 0011
4 0100
5 0101
6 0110
7 0111
8 1000
9 1001
10 or A 1010
11 or B 1011
12 or C 1100
13 or D 1101
14 or E 1110
15 or F 1111