Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
14 views39 pages

Number System

The document discusses encoding schemes and number systems used in computing, including ASCII, ISCII, and Unicode, which assign numeric codes to characters for computer understanding. It explains the binary, octal, decimal, and hexadecimal number systems, detailing how to convert between them and their significance in digital signal representation. Additionally, it covers the rules for binary addition and the importance of grouping bits for efficient representation.

Uploaded by

mccllumantodan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views39 pages

Number System

The document discusses encoding schemes and number systems used in computing, including ASCII, ISCII, and Unicode, which assign numeric codes to characters for computer understanding. It explains the binary, octal, decimal, and hexadecimal number systems, detailing how to convert between them and their significance in digital signal representation. Additionally, it covers the rules for binary addition and the importance of grouping bits for efficient representation.

Uploaded by

mccllumantodan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 39

Encoding Schemes

and Number System


• Computer must understand the character entered by user, for this
purpose numeric code is assigned to each character used in
computer.
• For example
• A– Z assigned with code 65-90
• a-z assigned with code 97-122
• 0-9 assigned with code 48-57
• There are various encoding scheme available
• ASCII
• ISCII
• UNICODE
• Stands for American Standard code for
information interchange.
• encoding scheme ASCII was developed for standardizing the
character representation.
• It is most widely used alphanumeric code for
microcomputers and minicomputers.
• It is 7-Bitccaonde, so it represent maximum of 27 = 128 code
i.e. 128 possible characters.
CHARACTERS DECIMAL CODE 7-BIT CODE
A 65 1000001
BASEDON
B 66 1000010
THESEVALUEWE
- - - CAN EASILY FIND
Z 90 1011010 ITSOCTAL &
HEXADECIMAL
a 97 1100001
REPRESENTATIO
- - - N
z 122 1111010
ENTERKEY 13 0001101
$ 36 0100100
+ 43 0101011
- - -
• CONVERTTHEFOLLOWING ASCII CODE INTTO ITSORIGINAL
MESSAGE
• 1000101 1011000 1000001 1001101
• Toconvert the above message we first convert the above 7-bit
code into decimal value as –
• 1000101 = 69 (it is code of ‘E’)
• 1011000 = 88 (it is code of ‘X’)
• 1000001 = 65 (it is code of ‘A’)
• 1001101 = 77 (it is code of ‘M’)
• So the original message is EXAM
• CONVERTTHEFOLLOWING MESSAGEINTO ASCIICODE
• STEP 1
• Toconvert first find out the binary value (either from ASCII table)
or manually we find out the decimal code then convert it in
binary. For e.g. if ‘A’ is 65 then following the sequence we can
find S= 83, T= 84, E= 69, P= 80
• SPACE= 32, 1 = 49
• Now convert the decimal into binary:
• 83 = 1010011, 84 = 1010100, 69 = 1000101, 80 = 1010000
• 32 = 0100000, 49 = 0110001
• So, original message:
• 1010011 1010100 1000101 1010000 0100000 0110001
• Stands for Indian Standard Code for Information Interchange
• ISCII we adopted in 1991, by Bureau by Indian Standards to
have commonstandard for Indian scripts.
• It is 8-bit encoding scheme and can represent 28 =256 chars.
• It retain first 128 for ASCII code
• ISCII is able to represent Indian language characters like : Tamil,
Telugu, Kannada, Oriya, Bengali, Assamese, Gujarati, etc.
• As we know ASCII and ISCII represent characters belonging to
different language by assigned unique code to each characters.
• Need arises to have encoding scheme which can represent all
the known language around the world. The result is UNICODE.
• It is the standard used worldwide now.
• Its variants are UTF-8, UTF-16,UTF-32
• Unicode 13.0 represent 143000 characters
• Supported by most OS, application independent
• Allows data to be transported between different system without
distortion.
Computers accept input and deliver output in the form of digital
signals.
Adigital signal hasonly two states, represented by two voltage
levels, high and low.
For a computer to process numbers, it is important to be able to
represent the numbersasdigital signals.
Toachieve this, you need a number system that usesonly two symbols to
represent any number.
The binary number system usesonly two symbols, 0 and 1, to represent
any number, and therefore provides a direct way of representing
numbersin computers.
Two other number systems, octal and hexadecimal, help represent
binary numbers concisely, making it convenient to deal with large
strings of 0sand1s.
 Anumber systemis known by its radix or base.
 Thedecimal number system uses10 symbols, and therefore, has a
radix or base of 10. Thebinary number system usestwo symbols,
and therefore, hasa radix of 2.
 The radix of a number is usually written as a subscript with that
number, where the number is written within parentheses, as shown
in the following examples:
 (368)10
 (10101)2
• The decimal number system uses10 symbols, and therefore has
a radix or base of 10.
• Symbols are [ 0 to 9 ]
• Every digit in Decimal number system is identified from its
position i.e. from right to left as (for e.g. 345) :-
Number 3 4 5
POSITIONAL VALUE 102 101 100
• It means : 3 x 102 + 4 x 101 + 5 x 100 = 345
• 3 x 100 + 4 x 10 + 5 x 1 = 345
• Left most digit will be MSD (most significant digit and right most
digit will be LSD(least significant digit)
• The binary number system uses 2 symbols, and therefore has a radix
or base of 2.
• Symbols are [ 0 and 1 ], also known as bits or binary digit
• Every bit in Binary number system is identified from its position i.e.
from right to left as (for e.g. 110) :-

Binary Number 1 1 0
POSITIONAL VALUE 22 21 20
• It means : 1 x 22 + 1 x 21 + 0 x 20 will give its decimal equivalent
• 1 x 4 + 1 x 2 + 0 x 1 = 6, So (110)2 = (6)10
• Left most digit will be MSB(most significant bit and right most digit
will be LSB(least significant bit)
• The octal number system uses 8 symbols, and therefore has a
radix or base of 8.
• Symbols are [ 0 to 7 ]
• Every bit in Octal number system is identified from its position
i.e. from right to left as (for e.g. 140) :-

Binary Number 1 4 0
POSITIONAL VALUE 82 81 80
• It means : 1 x 82 + 4 x 81 + 0 x 80 will give its decimal
equivalent
• 1 x 64 + 4 x 8 + 0 x 1 = 96, So (140)8 = (96)10
• The Hex number system uses16 symbols, and therefore has a
radix or base of 16.
• Symbols are [ 0 to 9 and A to F ]
• 10 is represented as A and soon
• Every bit in Hex number system is identified from its position i.e.
from right to left as (for e.g. A2B) :-
Binary Number A 2 B
POSITIONAL VALUE 162 161 160
• It means : Ax162 + 2x161 + Bx160 will give its decimal equivalent
• 10x256 + 2x16 + 11x1 = 2603, So (A2B)16 = (2603)10
 At times, you need to covert a number from one number system to
another.
 Distinct methods have been defined for conversion between each
pair of number systems.
 You can convert a decimal number to its binary form by using the
method of successive division by 2, the radix of the binary
number system.
 Put the remainder to the right of quotient and repeat this process
till the quotient becomesZEROor ONE.
 Write down the remainders in reverse order to get equivalent
binary number.
LSB

MSB

ANSWER: (101101)2
• (79)10 to ( ? )2
• (30)10 to ( ? )2
 Multiply each bit of binary number by its place value i.e. 2n
 Add the result.

1 0 1 0 1 1 0 1
27 26 25 24 23 22 21 20

128 x 1 64 x 0 32 x 1 16 x 0 8x1 4x1 2x0 1x1

128 0 32 0 8 4 0 1

ANSWER: (73)10
• ( 11110110) 2 to ( ? ) 10
• ( 101010110101) 2 to (?) 10
 You can convert a decimal number to its octal form by using the
method of successive division by 8, the radix of the octal number
system.
 Put the remainder to the right of quotient and repeat this process
till the quotient becomes ZERO.
 Write down the remainders in reverse order to get equivalent
octal number.
LSD

MSD

ANSWER: (135)8
• ( 1 7 3 ) 10 to ( ?
• )(82 4 3 ) 10 to ( ?
)8
 Multiply each bit of octal number by its place value i.e. 8n
 Add the result

2 3 7
82 81 80

64x2 8x3 1x7

128 24 7

ANSWER: (159)10
 You can convert a decimal number to its octal form by using the
method of successive division by 16, the radix of the
hexadecimal number system.
 Put the remainder to the right of quotient and repeat this process
till the quotient becomes ZERO.
 Write down the remainders in reverse order to get equivalent
hexadecimal number.
LSD

A=10
B=11, and so on.
..
MSD

ANSWER: (B2)16
• ( 2 3 3 ) 10 to ( ?
• )(167 9 ) 10 to ( ?
) 16
 Multiply each bit of hexadecimal number by its place value i.e.
16n
 Add the result

A 2 B
162 161 160

256x10 16x2 1x11

2560 32 11

ANSWER: (2603)10
• As number of bits increases, there is a need arises of grouping
of bits.
• Octal number comprises of 3 bits i.e. 3 binary bits are used to
represent octal number.
OCTAL BINARY
0 000
1 001
2 010
3 011
4 100
5 101
6 110
7 111
3 5 2
011 101 010

ANSWER: (011101010)2
• ( 2 3 7 ) 8 to (
• ?( )220 6 ) 8 to ( ?
)2
• It requires grouping of 3 bits from right hand side, if last group
not consists of 3 bit then add 0 to make it group of 3 bit

MAKE GROUP OF 3 BITS

3 2 6 6

Extra 0 is ANSWER: (3266)8


padded to make
it of 3 bits
• ( 111000111001) 2 to ( ? ) 8
• ( 101010101010101) 2 to ( ? ) 8
• Hexadecimal number comprises of 4 bits i.e. 4 binary bits are
used to represent Hexadecimal number.
HEXADECIMAL BINARY HEXADECIMAL BINARY
0 0000 A 1010
1 0001 B 1011
2 0010 C 1100
3 0011 D 1101
4 0100 E 1110
5 0101 F 1111

6 0110
7 0111
8 1000
9 1001
8 B C 2
1000 1011 1100 0010

ANSWER: (1000101111000010)2
• (CAFE) 16 to (
• ?( )728 F 9 ) 16 to (
?) 2
• It requires grouping of 4 bits from right hand side, if last group
not consists of 4 bit then add 0 to make it group of 4 bit

MAKE GROUP OF 4 BITS

6 B 6 6

Extra 0 is ANSWER: (6B66)8


padded to make
it of 4 bits
• (10101010101010101) 2 to ( ? ) 16

• (110011110001101) 2 to ( ? ) 16
• Toperform binary addition, we have to follow the simple rules
like:
• 0+ 0=0
• 0+ 1=1
• 1 + 1 = 0 (and 1 carry to left)
• 1 + 1 + 1 = 1 ( and 1 carry to left )

• Note : if number of 1’s is in even then result will be 0 and n no. of 1


will carry to left where n is the number of pair
• If the number of 1’s in in odd the result will be 1 and n no. of 1
will carry to left where n is the number of pair
CARRY

ADDITION
RESULT

ANSWER : 1100011
CARRY

ADDITION
RESULT

ANSWER : 11110001

You might also like