Number System Mep

NUMBER SYSTEM & COMPUTER
ARITHMETIC
CS 211 COMPUTER FUNDAMENTALS
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Objectives
Learn the following
Positional Number system
Different number system
Conversion of number system
Fractional numbers
Computer arithmethic
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
based on exactly where the numbers are in the
sequence of numbers
A number is represented by a string of digits
where each digit position has an associated
weight.
The value of each digit in such a number is
determined by three considerations:
1. The digit itself,
2. The position of the digit in the number, and
3. The base of the number system.
Decimal (base 10) numbers are expressed in the
positional notation
4202 = 2x10
0
+ 0x10
1
+ 2x10
2
+ 4x10
3
The right-most is the least significant digit
The left-most is the most significant digit
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
4202 = 2x10
0
+ 0x10
1
+ 2x10
2
+ 4x10
3
1s multiplier
1
positional notation
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
4202 = 2x10
0
+ 0x10
1
+ 2x10
2
+ 4x10
3
10s multiplier
10
positional notation
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
4202 = 2x10
0
+ 0x10
1
+ 2x10
2
+ 4x10
3
100s multiplier
100
positional notation
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
4202 = 2x10
0
+ 0x10
1
+ 2x10
2
+ 4x10
3
1000s multiplier
1000
positional notation
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary (base 2) numbers are also
expressed in the positional notation
10011=1x2
0
+1x2
1
+0x2
2
+0x2
3
+1x2
4
The right-most is the least significant digit
The left-most is the most significant digit
10011 =1x2
0
+1x2
1
+0x2
2
+0x2
3
+1x2
4
1s multiplier
1
10011 =1x2
0
+1x2
1
+0x2
2
+0x2
3
+1x2
4
2s multiplier
2
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
10011=1x2
0
+1x2
1
+0x2
2
+0x2
3
+1x2
4
4s multiplier
4
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
10011=1x2
0
+1x2
1
+0x2
2
+0x2
3
+1x2
4
8s multiplier
8
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
10011 =1x2
0
+1x2
1
+0x2
2
+0x2
3
+1x2
4
16s multiplier
16
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Counting in
Decimal
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
30
31
32
33
34
35
36
.
.
.
0
1
10
11
100
101
110
111
1000
1001
1010
1011
1100
1101
1110
1111
10000
10001
10010
10011
10100
10101
10110
10111
11000
11001
11010
11011
11100
11101
11110
11111
100000
100001
100010
100011
100100
.
.
.
Counting
in Binary
Number system
A number system uses a specific radix (base)
e.g. Decimal base 10
Binary base 2
In digital electronics (computer) the only choice of
base in which to perform arithmetic is base-2, that is
binary arithmetic, using the only two digits available, 0
and 1.
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Decimal number system
uses the common 0 thru 9 digits
Single-digit numbers 0 to 9 make up the set numbers
called units or ones
When the count is higher than 9 the number is carried
over to what is called the tens position
If the number is over 99 the carried over number is in the
hundreds position.
After the hundreds the position are thousands, ten
thousands, hundred thousand, millions, etc.
Each position, or place value, to the left increases by a
factor of 10.
Thus, the decimal number system is the base 10 system
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Number System
Also called the Base 2 system
The binary number system is used to
model the series of electrical signals
computers use to represent information
0 represents the no voltage or an off state
1 represents the presence of voltage or an
on state
known as machine language
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Digit (Bit)
A bit (binary digit)
is the smallest unit of information
can have two values - 1 and 0.
Binary digits, or bits, can represent
numbers, codes, or instructions.
Byte: a grouping of eight bits of
information
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Number System
The names of the first few places in the binary notation are:
16s 8s 4s 2s 1s
(the places are powers of two):
2
x
2 2
x x
2 2 2
x x x
2 2 2 2 1
16s 8s 4s 2s 1s
Each place is double the last place from the right to left
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Octal Number System
Also known as the Base 8 System
Uses digits 0 - 7
Readily converts to binary
Groups of three (binary) digits can be
used to represent each octal digit
Also uses multiplication and division
algorithms for conversion to and from base
10
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Hexadecimal Number System
Base 16 system
Uses digits 0-9 &
letters A,B,C,D,E,F
Groups of four bits
represent each
base 16 digit
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Integer Representation
Use 8, 16, 32 or 64 bit to represent number using
positional notation
Unsigned -- 10101010=170
Cant represent negative numbers
Simple
8 bit unsigned integer from 0 to 255
Signed -- 10101010= -42
The most significant bit of a binary number is usually
used as the sign bit.
Uses MSB for sign 1 = - , 0 = +
computers do not subtract very well
8 bit signed integer from 127 to 128
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
(4bit)Signed numbers
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
1s compliment & 2s complement used to
represent positive and negative number
Allows the computer to use addition to
deal with subtraction
Integer Representation
1s complement
5
00000101
-5
11111010
2s complement
5
00000101
-5
11111010 + 1 = 11111010
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Fractional numbers (Floating point Representation)
single precision binary floating-point
format ( binary32)
Sign bit: 1 bit (1 negative, 0 positive)
Exponent: width: 8 bits
Significand precision(mantissa): 23
(IEEE 754 single precision binary floating-point format)
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Code
A digital system requires that all its information be in
binary form. But the External world uses the alphabetic
characters, decimal digits, and special Characters (e.g.,
periods, commas, plus and minus signs) to represent
information.
A unique pattern of 0s and 1s is used to represent each
required character. This pattern is the code
corresponding to that character.
several codes that are commonly used in digital
systems.
Binary Coded Decimal
Alphanumeric Codes
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Coded Decimal
Each Decimal digit is coded into 4 bits
DECIMAL BCD
0 0000 5 0101
1 0001 6 0110
2 0010 7 0111
3 0011 8 1000
4 0100 9 1001
Only ten of the possible sixteen (2
4
) patterns of bits are
used.
e.g. 432
10
would represented as:
0100 0011 0010
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Alphanumeric Codes
Extended BCD Interchange Code (EBCDIC)
American Standard Code for Information Interchange (ASCII).
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
NUMBER SYSTEM
CONVERSION
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Decimal to Binary Conversion
The easiest way to convert a decimal number to its
binary equivalent is to use the Division Algorithm
This method repeatedly divides a decimal number by 2
and records the quotient and remainder (stop when
quotient is zero)
The remainder digits (a sequence of zeros and ones)
form the binary equivalent.
The first remainder is the least significant digit(LSD),and
the last Remainder is the most significant digit(MSD).
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Decimal to Binary Conversion
Convert decimal number 28
10
into binary.
282 = 14 RcmoinJcr u (LSD)
142 = 7 RcmoinJcr u
72 = S RcmoinJcr 1
S2 = 1 RcmoinJcr 1
12 = u RcmoinJcr 1 (MSD)
The Binary number is 11100
2
Convert decimal number 122
10
into binary.
1222 = 61 RcmoinJcr u (LSD)
612 = Su RcmoinJcr 1
Su2 = 1S RcmoinJcr u
1S2 = 7 RcmoinJcr 1
72 = S RcmoinJcr 1
S2 = 1 RcmoinJcr 1
12 = u RcmoinJcr 1 (MSD)
2 CS 211 COMPUTER FUNDAMENTALS
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary to Decimal Conversion
The easiest method for converting a
binary number to its decimal equivalent is
to use the Multiplication Algorithm
Multiply the binary digits by increasing
powers of two, starting from the right
Then, to find the decimal number
equivalent, sum those products
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Convert binary number 11100
2
into decimal.
1 1 1 0 0
1 x 2
4
= 16 1 x 2
3
= 8 1 x 2
2
= 4
0 x 2
1
= 0
0 x 2
0
=0
16 + 8 + 4 = 28
10
Binary to Decimal Conversion
2
into decimal.
1 1 1 1 0 1 0
1 x 2
6
=
64
1 x 2
5
=
32
1 x 2
4
=
16
1 x 2
3
=
8
0 x 2
2
=
0
1 x 2
1
=
2
0 x 2
0
=0
64 + 32 + 16 + 8 + 2 = 122
10
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
To convert a decimal number into hexadecimal,
divide the number repeatedly by 16 and take
the remainders. The first remainder is the LSD,
and the last remainder is the MSD.
Decimal to Hexadecimal Conversion
Convert Decimal number 684
10
into Hexadecimal.
C (LSD)
A
2 (MSD)
The Hexadecimal number is 2AC
16
10
into Hexadecimal.
E (LSD)
3
3 (MSD)
The Hexadecimal number is 33E
16
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
To convert a decimal number into octal, divide the
number repeatedly by 8 and take the remainders.
The first remainder is the LSD, and the last remainder is
the MSD.
Decimal to Octal Conversion
10
into Octal.
1S98 = 19 RcmoinJcr 7 7 (LSD)
198 = 2 RcmoinJcr S 3
2u = u RcmoinJcr 2 2 (MSD)
The Hexadecimal number is 237
8
10
into Octal.
46u8 = S7 RcmoinJcr 4 4 (LSD)
S78 = 7 RcmoinJcr 1 1
7u = u RcmoinJcr 7 7 (MSD)
The Hexadecimal number is 714
8
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary to Hexadecimal Conversion
To convert a binary number into hexadecimal, arrange
the number in groups of four and find the hexadecimal
equivalent of each group (use a substitution code).
If the number cannot be divided exactly into groups of
four, insert zeros to the left of the number as needed so
the number of Digits are divisible by four.
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Each hex number converts to 4 binary digits
2
into decimal.
1001 1111
1 0 0 1 1 1 1 1
1 x 2
3
= 8
0 x 2
2
= 0
0 x 2
1
= 0
1 x 2
0
= 1
1 x 2
3
= 8
1 x 2
2
= 4
1 x 2
1
= 2
1 x 2
0
= 1
8 + 1 = 9
10
= 9 8 + 4 + 2 + 1 = 15
10
= F
10011111
2
= 9F
16
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Convert 010101101010111001101010
2
to hex
using the 4-bit substitution code :
1010
0101 0110 1010 1110 0110
5 6 A E 6
A
56AE6A
16
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Substitution code can also be used to convert
binary to octal by using 3-bit groupings:
Convert binary 010101101010111001101010
25527152
8
Binary to Octal Conversion
010 101 101 010 111 001
101 010
2 5 5 2 7 1 5 2
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
To convert an octal number into binary,
write the 3-bit binary equivalent of each
octal digit
Octal to Binary Conversion
convert 75
8
to binary
7 5
111 101
2
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
To convert an octal number into binary,
write the 3-bit binary equivalent of each
octal digit
Octal to Binary Conversion
convert 75
8
to binary
7 5
111 101
2
convert 653
8
to binary
6 5 3
110 101 011
2
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Octal to Decimal Conversion
To convert an octal number into decimal, calculate
the sum of the powers of 8 of the number.
Convert 653
8
to its
decimal equivalent:
6 5 3
6 x 8
2
=
384
5 x 8
1
=
40
3 x 8
0
=
3
384 + 40 + 3 = 427
653
8
= 427
Convert 237
8
to its
decimal equivalent:
2 x 8
2
= 128
3 x 8
1
= 24
7 x 8
0
= 7
237
8
= 159
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Two step
Octal to Binary
Binary to Hexadecimal
Octal to Hexadecimal Conversion
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Decimal fraction to Binary fraction
Convert decimal number 0.875
10
into binary.
2 x
0.875
= 1.750 1
2 x
0.750
= 1.5 1
2 x 0.5 = 1.0 1
The Binary number is 0.111
2
Convert decimal number
0.125
10
into binary.
2 x
0.125
= 0.250 u
2 x
0.250
= 0.5 u
2 x 0.5 = 1.0 1
2
repeatedly doubling the decimal fraction.
Until a 0 remains to the left of the decimal
point or until the desired precision
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
10
into binary.
2 x 0.345 = 0.69 u
2 x 0.69 = 1.38 1
2 x 0.38 = 0.76 u
2 x 0.76 = 1.52 1
2 x 0.52 = 1.04 1
2 x 0.04 = 0.08 u
2 x 0.08 = 0.16 u
2 x 0.16 = 0.32 u
2 x 0.32 = 0.64 u
2 x 0.64 = 1.28 1
2
Decimal fraction to Binary fraction
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary fraction to Decimal fraction
Convert binary number 0.001
2
into decimal.
. 0 0 1
0 x 2
-1
= 0 0 x 2
-2
= 0 1 x 2
-3
= 0.125
0.001
2
= 0.125
10
2
into decimal.
. 1 1 1
1 x 2
-1
= 0.5 1 x 2
-2
= 0.25 1 x 2
-3
= 0.125
0.111
2
= 0.5 + 0.25 + 0.125 =
0.875
10
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
2
into decimal.
. 0 1 0 1 1 0 0 0 0 1
0 x
2
-1
=
0
1 x 2
-2
=
0.25
0 x
2
-3
=
0
1 x 2
-4
=
0.0625
1 x 2
-5
=
0.03125
0 x
2
-6
=
0
0 x
2
-7
=
0
0 x
2
-8
=
0
0 x
2
-9
=
0
1 x 2
-10
=
0.0009765625
0.0101100001
2
= 0.344727
10
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
2
into decimal.
. 0 1 0 1 1 0 0 0 0 1
0 x
2
-1
=
0
1 x 2
-2
=
0.25
0 x
2
-3
=
0
1 x 2
-4
=
0.0625
1 x 2
-5
=
0.03125
0 x
2
-6
=
0
0 x
2
-7
=
0
0 x
2
-8
=
0
0 x
2
-9
=
0
1 x 2
-10
=
0.0009765625
0.0101100001
2
= 0.344727
10
10
into binary.
2 x 0.345 = 0.69 u
2 x 0.69 = 1.38 1
2 x 0.38 = 0.76 u
2 x 0.76 = 1.52 1
2 x 0.52 = 1.04 1
2 x 0.04 = 0.08 u
2 x 0.08 = 0.16 u
2 x 0.16 = 0.32 u
2 x 0.32 = 0.64 u
2 x 0.64 = 1.28 1
2
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
BINARY ARITHMETIC
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Addition
similar to the addition of decimal numbers.
Numbers in each column are added together
with a possible carry from a previous column.
carry bit
u
u
u
+
1
u
1
+
u
1
1
+
1
1
u
+
1
1
1
1
1
+
1
1
+
1
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Addition
11
S
6 1
1u11
1u1
1 u
1 1
u uu
1
+
+
1S
u
S S
1111
1uu
1 1 1 uu
+
+
2 u 1
u
1
1
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Addition
11 1 u
1u 1
u 1 u 1
2S
7
u 9.
+
+
S.
S. S
u
.
1 1
.
u u
.
u1 1 u
1 u u
1 u u u
S
2
S 2u.
+
+
9.
11. S
7
.
1 1
.
1 1
.
1
1
1
1 1
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Subtraction
With a
borrow
of 1
u
u
u
-
1
u
1
-
u
1
u
-
1
1
1
-
e.g.
16
S
S 1
1 uuu
11 u
1
1
11
u 11
-
-
u
1
6.2S
.S
.7S 1
1 u.u
u 1
1
1
1
1
1
-
-
1
u
4
.
.
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
1s complement
Switch all 0s to 1s and 1s to 0s
Binary # 10110011
1s complement 01001100
2s complement
Step 1: Find 1s complement of the number
Binary # 11000110
1s complement 00111001
Step 2: Add 1 to the 1s complement
00111001
00000001
00111010
Binary Subtraction using complement
Binary subtraction is tricky due to the borrowing process and prone
to error and alternative and easy way is using number complement
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Subtraction using 1s complement
16
S
S 1
1 uuu
11
1
11
u 11
-
-
u
1
1 uuu
uu
u u 11
+
u
1 1 1
u
1
1
1 u 11
When subtraction is performed in the
1s complement system, any end-
around carry is added to the least
significant bit
Involves forming the 1s complement of the subtrahend and
then adding this complement to the minuend
1s complement
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Subtraction using 2s complement
16
S
S 1
1 uuu
11
1
11
u 11
-
-
u
1
1 uuu
u1
1 u 11
+
u
1 1 1
u
1
1
When subtraction is performed in the
2s complement system, any end-
around carry is dropped
Involves forming the 2s complement of the subtrahend and
then adding this complement to the minuend
2s complement
uu 1 1 1 +
1 u 11 u
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
u
1
1 u.u
u 1
1
1
1
1
1
-
1
u
.
.
1
1
1 u.u
1 u
u 1
u
1
+
1
.
.
1
u u
1
1
1
1
1 1 1.
u u
1
1
1 u.u
1 1
1 1
u
1
+
1
.
.
u
u u
1
1
using 2s complement using 1s complement
Binary Subtraction
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Multiplication and division
u
u
u
x
1
u
u
x
u
1
1
x
1
1
u
x
multiplication rule
u 1 u
Division rule
=
1 1 1
=
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
Binary Multiplication
1u
12u
x
12
1 uu
u
1 1 1
+
1
1 1 u
u uu u
1 uu 1
u uu u
1 uu 1
1 uu u
2.S
62S
x
1.2S
2Su
1 u
1
1
1 1
+
.
1 . u
1u1
u u u
1 1 u
. u1 u
S.12S
1
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012
2S
S
S
1 1 u 1
1 u u 1
u 1 1
u 1 1
u 1 1
u 1 1
1 1 1 1 u u u 1
u 1 u
u
11
u 1 1
11
1
29
2.416
12
u .
u
u
uu
u u
u 1 u
11
uu
u u
u 1 u
11
uu
u u
11
u
. 1u1u1..
Binary Division
MEP_MIT-AQUI NAS 1
st
term sy 2011-2012

Number System Mep

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Number System Mep

Hochgeladen von

Copyright:

Verfügbare Formate

NUMBER SYSTEM & COMPUTER

Das könnte Ihnen auch gefallen