Decimal Number

System Binary Number

System Octal Number
System
Hexadecimal Number
System ASCII, ISCII,
UNICODE
 Computers accept input and deliver output in the form of digital
signals.
 A digital signal has only 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 numbers as digital signals.
 To achieve this, you need a number system that uses only two
symbols to represent any number.
 The binary number system uses only two symbols, 0 and 1, to
represent any number, and therefore provides a direct way of
representing numbers in computers.
 Two other number systems, octal and hexadecimal, help represent
binary numbers concisely, making it convenient to deal with large
strings of 0s and 1s.
 A number system is known by its radix or base.
 The decimal number system uses 10 symbols, and therefore,
has a radix or base of 10. The binary number system uses two
symbols, and therefore, has a 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 uses 10 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 1 1 0
Number
POSITIONAL VALUE 22 21 20
• It means : 1 x 22 + 1 x 21 + 0 x 20 will give its decimal
equivalent
• 1x4+ 1x2+ 0x1= 6, So (110)2 =
will be LSB(6)
(least
10 significant bit)
• Left most digit will be MSB (most significant bit and right most
• 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 1 4 0
Number
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 uses 16 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 so on
• Every bit in Hex number system is identified from its position
i.e. from right to left as (for e.g. A2B) :-
Binary A 2 B
Number
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 becomes ZERO or ONE.
 Write down the remainders in reverse order to get
equivalent
binary number.
 LS
B

MS
B
ANSWER: (101101)2
• (79)10 to
• (30)10 ( ? )2
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.
 LS
D

MS
D

ANSWER: (135)8
• (173) 10 to
• ((243)
? ) 8 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.
 LS
D

A=10
B=11, and so
on.
MS
..
D

ANSWER: (B2)16
• (233) 10 to ( ? )
• 16(7 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
• (237) 8 to
• ((206)
? ) 2 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
• ((78F9)
? ) 2 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:
padded to
make
it of 4 bits
(6B66)8
• ( 10101010101010101) 2 to ( ? )
• 16
( 110011110001101) 2 to ( ? )
16
• To perform 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
 CAR
RY
ADDITIO
N
RESULT

ANSWER :
1100011
CARRY

ADDITIO
N
RESULT

ANSWER :
11110001
• Computer must understand the character entered by user, for
this purpose numeric code is assigned to each character used in
computer.
• For example
• A– assigned with code 65-90
Z assigned with code 97-
• a-z 122 assigned with code
• 0-9
• There 48-57 encoding scheme
are various
available
• ASCII
• ISCII
• UNICODE
• Stands for American Standard code for
information interchange.
• It is most widely used alphanumeric code for
microcomputers and minicomputers.
• It is 7-Bit code, so it can represent maximum of 27 = 128
code
i.e. 128 possible characters.
CHARACTERS DECIMAL CODE 7-BIT CODE
A 65 1000001
B 66 1000010 BASED ON
THESE VALUE
- - - WE CAN
Z 90 1011010 EASILY FIND
a 97 1100001 ITS OCTAL &
HEXADECIMAL
- - - REPRESENTATIO
z 122 1111010 N
ENTER KEY 13 0001101
$ 36 0100100
+ 43 0101011
- - -
• CONVERT THE FOLLOWING ASCII CODE INTTO ITS
ORIGINAL MESSAGE
• 1000101 1011000 1000001 1001101
• To convert 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
• So the original message
‘A’) is
EXAM
• 1001101 = 77 (it is code of
‘M’)
• CONVERT THE FOLLOWING MESSAGE INTO ASCII CODE
• STEP 1
• To convert 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 common standard for Indian scripts.
• It is 8-bit encoding scheme and can represent 28 =256 chars.
• It retain first 128 for ASCII code
• ASCII 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, making it platform, vendor,
application independent
• Allows data to be transported between different system
without
distortion.
• It is variable length encoding scheme that can represent
each character in UNICODE character set.
• The code unit of UTF-8 is 8 bits i.e. OCTET
• UTF-8 can use 1 OCTET to maximum 6 OCTET depending upon the
character it represent.
• Unicode code points are written as U+<codepoint> for e.g.
U+0050
represent ‘P”
Unicode Code Unicode Code Number
Points (Decimal) Points (Hex) of octets
used
U-0 to U-127 U+00 to U+07F 1 octet (8 bits)
U-128 to U-2047 U+80 to U+7FF 2 octets (16
bits)
U-2048 to U-65535 U+800 to U+FFFF 3 octets (24
bits)
U-65536 to U-2097151 U+10000 to U+1FFFFF 4 octets (32
• 1 OCTET (8 BIT REPRESENTATION)
• For 1 octet representation the left most bit act as control
bit which stores ZERO (0)
• The control bit is special bit that store the control code not
the actual character. Rest of the bit stores the actual’s
binary code
• For Example ( U + 0050 ) (Binary value of P is 1010000)

0 1 0 1 0 0 0 0

ACTUAL BINARY
CODE
CONTROL
CODE
• 2 OCTET (16 BIT REPRESENTATION)
• First 3 bits (left most) of first octet will be 110
• First 2 bits (left most) of second octet will be 10
• For Example ( U + 00A7) (Binary value of  is
10100111)
1 1 0 0 EMPTY
0 BITS 0 1 0
OCTET 1
1 0 1 0 0 1 1 1 OCTET
2
• 3 OCTET (24 BIT REPRESENTATION)
• First 4 bits (left most) of first octet will be 1110
• First 2 bits (left most) of second octet will be 10
• First 2 bits (left most) of third octet will be 10
• For Example ( U + 203B)
• (Binary value of ※ is 10000000111011)
EMPTY BITS
1 1 1 0 0 0 1 0 OCTET 1

1 0 0 0 0 0 0 0 OCTET 2

1 0 1 1 1 0 1 1 OCTET 3
• 4 OCTET (32 BIT REPRESENTATION)
• First 5 bits (left most) of first octet will be 11110
• First 2 bits (left most) of 2nd , 3rd , 4th octet will
be 10
•• For Example
(Binary value ( U + 12345)
is
of 𒍅 00010010001101000101)
1 1 1 1 0 0 EMPTY
0 BIT 0
OCTET
1 0 0 1 0 1 0 0
1
1 0 0 0 1 1 0 1
OCTET
2
1 0 0 0 0 1 0 1
OCTET
3
• It is fixed length encoding scheme that uses exactly 4 bytes
to represent all Unicode characters.
• It stores every character using 4 bytes
• Example: Consider the Symbol * [U+002A binary-
00101010]
0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0

0 0 1 0 1 0 1 0