MODULE – I

NUMBER SYSTEMS

 NUMBER SYSTEMS: DECIMAL, BINARY, HEXADECIMAL, OCTAL

Number System is a way of representing numbers in Computer Architecture. Computer can
only understand numbers. When we enter data, the data is converted into electric pulse
(digital form). Each pulse is identified as a code and the code is converted to numeric format
by ASCII. A numeric value that computer understands is assigned to each number, character
and symbol.
The characteristics that define a number system include –
 The number of independent digits used in the number system.
 The place values of different digits constructing the number.
 The maximum numbers that can be written with the given number of digits.
Radix/Base – Radix/Base of a number system is the number of independent digits or symbols
used in the number system.
The number systems used in computers are –
1. Decimal Number System
2. Binary Number System
3. Octal Number System
4. Hexadecimal Number System

1. Decimal Number System - In Decimal Number System, the base is 10. It means that
the maximum number of individual representations in this number system is 10. The digits
are 0,1,2,3,4,5,6,7,8,9. The maximum value is 9 and the minimum value is 0.
A number represented in Decimal Number system will e having the subscript 10 as the
base indication. E.g., 23410, 1210

2. Binary Number System – In Binary Number System, the base is 2. It uses only two
distinct symbols – 0 and 1. The absence of an electronic pulse (input) is represented using
0 whereas the presence of an electronic pulse is represented using 1. A binary digit is
called a bit. A representation in binary has a sequence of bits. A binary pointer separates
integer and fractional parts.

A number in Binary Number System will be having the base indication 2 as subscript.
E.g., 110112, 11000112

MODULE – 1- CA PROF. ANJALI SOMAN

MODULE – 1- CA PROF. ANJALI SOMAN
 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

NUMBER BINARY REPRESENTATION

0 0000
1 0001
2 0010
3 0011
4 0100
5 0101
6 0110
7 0111
8 1000
9 1001
10 1010
11 1011
12 1100

3. Octal Number System – In Octal Number System, the base is 8. The independent
symbols in Octal number system are 0,1,2,3,4,5,6,7. the maximum value is 7 and the
minimum value is 0. A number that belongs to the octal representation can be identified
using the subscript representation of 8. E.g., 1238, 2348

4. Hexadecimal Number System – In Hexadecimal Number System, the base is 16. The
values included in Hexadecimal number system are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D,
E, F. The numbers represented in hexadecimal number system is identified using the radix
16. E.g., A1216, 124F16.

 NUMBER SYSTEM CONVERSIONS


1. Conversion of decimal number to any number system:
 Step 1: convert the integer part by doing successive division using the radix of
asked number systems.
 Step 2: convert the fractional part by doing successive multiplication using radix
of asked number system

2 Conversion of decimal to binary number system:

 The radix of asked number system is 2

Qn: Convert 8710 to ()2

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

Therefore, Binary of 87 is (1010111)2

Qn: Convert (14.625)10 decimal number to binary number
The Binary of 14 is 1110.
 1st Multiplication Iteration: Multiply 0.625 by 2
0.625 x 2 = 1.25(Product)
Fractional part=0.25 Carry=1 (MSB)
 2nd Multiplication Iteration: Multiply 0.25 by 2
0.25 x 2 = 0.50(Product)
Fractional part = 0.50 Carry = 0
 3rd Multiplication Iteration: Multiply 0.50 by 2
0.50 x 2 = 1.00(Product)
Fractional part = 1.00 Carry = 1 (LSB) =>(101)2
The binary of (14.625)10 is (1110.101)2
3 Conversion of decimal to octal number system:
 The radix of asked number system is 8
Qn: Convert (264)10 decimal number to octal

Therefore, the octal of 264 is 4108.

Qn: Convert (105.589)10 decimal number to octal number
MODULE – 1- CA PROF. ANJALI SOMAN
 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

Therefore, the octal of (105.589) is 151. 45548.

4 Conversion of decimal to Hexadecimal number system:

 The radix of asked number system is 16
Qn: (1693) to Hexadecimal number
1693/16 = 105 - Remainder (13) D (LSB)
105/16 = 6 - Reminder 9
6/16 = 0 - Reminder 6 (MSB). So, hexadecimal of (1693) is (69D)16.
Qn: Convert (1693.0628)10 decimal fraction to hexadecimal fraction
1693/16 = 105 Reminder (13) D (LSB)
105/16 = 6 Reminder 9
6/16 = 0 Reminder 6 (MSB) (69D)

 Fraction part - Multiply 0.0628 by 16

0.0628 x 16 = 1.0048(Product) Fractional part=0.0048 Carry=1 (MSB)
 Multiply 0.0048 by 16
0.0048 x 16 = 0.0768(Product) Fractional part = 0.0768 Carry = 0
 Multiply 0.0768 by 16
0.0768 x 16 = 1.2288(Product) Fractional part = 0.2288 Carry = 1
 Multiply 0.2288 by 16
0.2288 x 16 = 3.6608(Product) Fractional part = 0.6608 Carry = 3 (LSB) (.1013)
Therefore, (1693.0628) = (69D.1013)16
5 Conversion of any number system to decimal number system:
 In general the numbers can be represented as N= A n-1r n-1 + = A n-2r n-2 +..+
A1 r 1 + A0 r0 + A-1 r1 + A-2 r2 +… Where n= number in decimal A= digit r=
radix of number system n= The number of digits in the integer portion of number
m= the number of digits in the fractional portion of number.

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

 Conversion of binary to decimal number system

Qn: Convert (101.101)2= ( ? )10
101.101 = 1 x 22 + 0 x 21 + 1 x 20 . 1 x 2-1 + 0 x 2-2 + 1 x 2-3
=1x4+0x2+1x1.1x(1/2)+0x(1/4)+1x(1/8)
= 4 + 0 + 1 . (1 / 2) + 0 + ( 1 / 8 )
= 5 + 0.5 + 0.125
= 5.625
Therefore (101.101)2 = (5.625)10

 Conversion of octal to decimal number system

Qn: Convert (128)8= ( ? )10
1238 = 1*82 + 2*81 + 3*80
= 64 + 16 + 3
= 73
The decimal equivalent of the number 1238 is 7310

Qn: Convert (21.21)8= (? )10

21.21 = 2 x 81 + 1 x 80 + 2 x 8-1 + 1 x 8-2
= 2 x 8 + 1 x 1+ 2 x ( 1 / 8 ) + 1 x ( 1 / 64 )
= 16 + 1 + (0. 2 5) + (0. 0 1 5 6 2 5)
= 17 + 0. 265625
= 17. 265625
Therefore (21.21)8 = (1 7. 2 6 5 6 2 5)10

 Conversion of hexadecimal to decimal number system

Qn: Convert (E F. B 1)16= (?)10

=> E x 161 + F x 160 . B x 16-1 + 1 x 16-2
= 14 x 16 + 15 x 1 . 11 x (1 / 16) + 1 x (1 / 256)
= 224 + 15 + (0. 6 8 7 5) + (0. 0 0 3 9 0 6 2 5)
= 239 + 0. 6914 = 239. 691406
Therefore (E F. B 1)16 = (2 3 9. 6 9 1 4 0 6)10

Qn: Convert ( 0.9D9 )16= ( ? )10

=> 0 x 160. 9 x 16-1 + D x 16-2 + 9 x 16-3
= 0 x 1. 9 x ( 1 / 16 ) + 13 x ( 1 / 256 ) + 9 x ( 1 / 4096 )
= 0 . (0. 5625) + (0. 050781) + (0. 0021972 )
= 0. (0. 6154782 ) = 0. 6154782

6 Conversion of binary to octal number system

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

Qn: Convert (101101001)2 to ()8

Divide the binary into group of three digits from LSB we will find the following pattern
101|101|001.Now writing the equivalent decimal number of each group we get 5 | 5 | 1 .
So, the equivalent octal number is 5518

Qn: Convert 11001100.101 to ()8

011|001|100. |101|
3 1 4. 5
So, the equivalent octal number is 314.58

7 Conversion of binary to hexadecimal number system

Qn: Convert 111100010 to ()16

Divide the binary into group of four digits from LSB
0001|1110|0010
Now writing the equivalent hexadecimal number of each group
1|E|2 So the equivalent
Hexadecimal number is 1E216

Qn: Convert 11000011001.101 to ()16

0110|0001|1001|.1010|
6 1 9. A
So, the equivalent Hexadecimal number is 619.A16

8 Conversion of octal number system to hexadecimal number system

Qn: Convert (25)8 to ()16

Step 1: Convert octal to binary
The binary equivalent of 25 is 010101
Step 2: Divide the binary into group of four digits from LSB
0001|0101
1 5
So, the equivalent Hexadecimal number is 1516.
9 Conversion of hexadecimal number system to octal number system

Qn: Convert (1A.2B)16 to ()8

Step1: First convert hexadecimal to binary
The binary equivalent of 1A.2B is 00011010.00101011

Step 2: Divide the binary into group of Three digits

011|010|.|001|010|110

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

3 2. 1 2 6
So, the equivalent octal number is 32.1268

 COMPLEMENTS- R’S COMPLEMENT, (R-1)’S COMPLEMENT

In digital computers to simplify the subtraction operation and for logical manipulation
complements are used. There are two types of complements for each radix system-
 Radix complement
 Diminished radix complement.
The first is referred to as the r’s complement and the second as the (r-1)’s complement.
r’s Complement Given a positive number N in base r with an integer part of n digits, the r’s
complement of N is defined as rn -N if N≠0 and 0 if N=0 (r-1)’s Complement Given a positive
number N in base r with an integer part of n digits and a fraction part of m digits, the (r-1)’s
complement of N is defined as rn -r -m-N.
1’s complement representation: The 1’s complement of a binary number is the number that
results when we change all 1’s to zeros and the zeros to ones.
2’s complement representation: The 2’s complement is the binary number that results when
we add 1 to the 1’s complement.

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

1’s complement subtraction:

Subtraction of binary numbers can be accomplished by the direct method by using the 1’s
complement method, which allows to perform subtraction using only addition. for subtraction
of two numbers. we have two cases. –
1. Subtraction of smaller number from larger number and
2. Subtraction of larger number from smaller number.
 1’s complement Subtraction of smaller number from larger number
Method: 1. Determine the 1’s complement of the smaller number.
2. Add the 1’s complement to the larger number.
3. Remove the carry and add it to the result. This is called end -around carry.

 1’s complement Subtraction of larger number from smaller number

Method: 1. Determine the 1’s complement of the larger number.
2. Add the 1’s complement to the smaller number.
3. Answer is in 1’s complement form. To get the answer in true form take the 1’s complement
and assign negative sign to the answer.

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

 ADDITION AND SUBTRACTION OF BCD

BCD or Binary Coded Decimal is a coding scheme used to represent decimal number (0 to 9) in
the form of binary digits of a group of 4-bits. Binary coded decimal is the simplest form to convert
decimal numbers into their equivalent binary format. Although, binary coded decimal or BCD is
not the same as the normal binary representation.
In binary coded decimal (BCD) coding scheme, each decimal digit is represented as a group of 4-
bit binary number. For a multi-digit decimal number, each digit of the decimal number is encoded
separately in the BCD.
As we know, a 4-bit binary number can represent 16 decimal digits, but in binary coded decimal,
BCD codes 1010, 1011, 1100, 1101, 1110, and 1111 equivalent to decimal 10, 11, 12, 13, 14, and
15 are considered illegal combinations.

Decimal Digit Binary Coded Decimal Code

0 0000

1 0001

2 0010

3 0011

4 0100

5 0101

6 0110

7 0111

8 1000

9 1001

 Decimal to Binary Coded Decimal Conversion

MODULE – 1- CA PROF. ANJALI SOMAN
 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

The following example shows how a decimal number is converted to a BCD code −
Convert (125)10 into its equivalent binary coded decimal (BCD) code.

Decimal number 1 2 5

BCD Weights 8 4 2 1 8 4 2 1 8 4 2 1

BCD Code 0 0 0 1 0 0 1 0 0 1 0 1

Hence, the binary coded decimal for (125)10 is (0001 0010 0101).

 BCD ADDITION
o Step 1 − Perform addition of two BCD numbers by following the rules of binary addition.
o Step 2 − If the result or sum is a 4-bit binary number which is less than or equal to 9, then
the sum is a valid BCD number.
o Step 3 − If the sum is a 4-bit number that is greater than 9 or if a carry is generated, then
it is an invalid sum.
o Step 4 − To obtain the corrected result/sum, add 6 (0110) to the 4-bit invalid sum. If a
carry is generated when 6 is added, then propagate and add this carry to the next 4-bit
group. This step is done to skip the six illegal BCD codes (i.e. 1010, 1011, 1100, 1101,
1110, and 1111).

 Rules of Binary Addition

First Bit Second Bit Result

0 0 0 + 0 = 0; no carry

0 1 0 + 1 = 1; no carry

1 0 1 + 0 = 1; no carry

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

1 1 1 + 1 = 0; carry = 1

Qn: Perform the addition 30 + 15 in BCD scheme.

Solution − Given decimal numbers and their equivalent BCD representation is,
(30)10 = (0011 0000)BCD
(15)10 = (0001 0101)BCD
The BCD addition of the given numbers is as below −

30 0011 0000

+ 15 + 0001 0101

45 0100 0101

Qn: Perform addition 678 + 535 in Binary Coded Decimal.

Solution − Given decimal numbers and their BCD representation is,
 (678)10 = 0110 0111 1000
 (535)10 = 0101 0011 0101
The BCD addition is as below −

678 0110 0111 1000

+ 535 + 0101 0011 0101

1213 1011 1010 1101 (All are illegal codes)

+ 0110 0110 0110 (Add 0110 to each)

1 0001 1 0000 1 0011 (Propagate carry)

+1 1 1

0001 0010 0001 0011 (Corrected Sum = 1213)

Qn: Add (+255)10 and (+63)10 in BCD

MODULE – 1- CA PROF. ANJALI SOMAN
 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

 ERROR DETECTING AND CORRECTING CODES

 Error Detection Codes
 Error Correction Codes

Error Detection Codes

Error detection codes are used to detect the error(s) present in the received data (bit stream).
These codes contain some bit(s), which are included (appended) to the original bit stream.
These codes detect the error, if it is occurred during transmission of the original data (bit
stream).
Example − Parity code, Hamming code.

Error Correction Codes

Error correction codes are used to correct the error(s) present in the received data (bit stream)
so that, we will get the original data. Error correction codes also use the similar strategy of
error detection codes.
Example − Hamming code.

Therefore, to detect and correct the errors, additional bit(s) are appended to the data bits at the
time of transmission.

Parity Code

It is easy to include (append) one parity bit either to the left of MSB or to the right of LSB of
original bit stream. There are two types of parity codes, namely even parity code and odd
parity code based on the type of parity being chosen.

Even Parity Code

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

The value of even parity bit should be zero, if even number of ones present in the binary code.
Otherwise, it should be one. So that, even number of ones present in even parity code. Even
parity code contains the data bits and even parity bit.

The following table shows the even parity codes corresponding to each 3-bit binary code.
Here, the even parity bit is included to the right of LSB of binary code.
Binary Code Even Parity Bit Even Parity Code

000 0 0000

001 1 0011

010 1 0101

011 0 0110

100 1 1001

101 0 1010

110 0 1100

111 1 1111
Here, the number of bits present in the even parity codes is 4. So, the possible even number of
ones in these even parity codes are 0, 2 & 4.
 If the other system receives one of these even parity codes, then there is no error in
the received data. The bits other than even parity bit are same as that of binary code.
 If the other system receives other than even parity codes, then there will be an error(s)
in the received data. In this case, we can’t predict the original binary code because we
don’t know the bit position(s) of error.
Therefore, even parity bit is useful only for detection of error in the received parity code. But,
it is not sufficient to correct the error.

Odd Parity Code

The value of odd parity bit should be zero, if odd number of ones present in the binary code.
Otherwise, it should be one. So that, odd number of ones present in odd parity code. Odd
parity code contains the data bits and odd parity bit.
The following table shows the odd parity codes corresponding to each 3-bit binary code.
Here, the odd parity bit is included to the right of LSB of binary code.

Binary Code Odd Parity Bit Odd Parity Code

000 1 0001

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

001 0 0010

010 0 0100

011 1 0111

100 0 1000

101 1 1011

110 1 1101

111 0 1110
Here, the number of bits present in the odd parity codes is 4. So, the possible odd number of
ones in these odd parity codes are 1 & 3.
 If the other system receives one of these odd parity codes, then there is no error in the
received data. The bits other than odd parity bit are same as that of binary code.
 If the other system receives other than odd parity codes, then there is an error(s) in the
received data. In this case, we can’t predict the original binary code because we don’t
know the bit position(s) of error.
Therefore, odd parity bit is useful only for detection of error in the received parity code. But it
is not sufficient to correct the error.

Hamming Code
Hamming code is useful for both detection and correction of error present in the received data.
This code uses multiple parity bits and we have to place these parity bits in the positions of
powers of 2.
The minimum value of 'k' for which the following relation is correct (valid) is nothing but the
required number of parity bits.
2k≥n+k+12k≥n+k+1 where,
'n' is the number of bits in the binary code (information)
'k' is the number of parity bits
Therefore, the number of bits in the Hamming code is equal to n + k.
Let the Hamming code is bn+kbn+k−1.....b3b2b1bn+kbn+k−1.....b3b2b1 & parity
bits pk,pk−1,....p1pk,pk−1,....p1. We can place the 'k' parity bits in powers of 2 positions only.
In remaining bit positions, we can place the ‘n’ bits of binary code.
Based on requirement, we can use either even parity or odd parity while forming a Hamming
code. But the same parity technique should be used in order to find whether any error present
in the received data.
Follow this procedure for finding parity bits.
 Find the value of p1, based on the number of ones present in bit positions b3, b5, b7 and
so on. All these bit positions (suffixes) in their equivalent binary have ‘1’ in the place
value of 20.

MODULE – 1- CA PROF. ANJALI SOMAN

 PKM Educational Trust

RR Institute of Management Studies

(Affiliated to Bangalore University, Recognized by Karnataka Government)
Raja Reddy Layout, Chikkabanavara, Bengaluru-560090
COURSES OFFERED:
BBA | BBA-Aviation | BCA | MSc & BSc -Forensic Science | BCom IQAC

 Find the value of p2, based on the number of ones present in bit positions b3, b6, b7 and
so on. All these bit positions (suffixes) in their equivalent binary have ‘1’ in the place
value of 21.
 Find the value of p3, based on the number of ones present in bit positions b5, b6, b7 and
so on. All these bit positions (suffixes) in their equivalent binary have ‘1’ in the place
value of 22.
 Similarly, find other values of parity bits.
Follow this procedure for finding check bits.
 Find the value of c1, based on the number of ones present in bit positions b1, b3, b5,
b7 and so on. All these bit positions (suffixes) in their equivalent binary have ‘1’ in the
place value of 20.
 Find the value of c2, based on the number of ones present in bit positions b2, b3, b6,
b7 and so on. All these bit positions (suffixes) in their equivalent binary have ‘1’ in the
place value of 21.
 Find the value of c3, based on the number of ones present in bit positions b4, b5, b6,
b7 and so on. All these bit positions (suffixes) in their equivalent binary have ‘1’ in the
place value of 22.
 Similarly, find other values of check bits.
The decimal equivalent of the check bits in the received data gives the value of bit position,
where the error is present. Just complement the value present in that bit position. Therefore, we
will get the original binary code after removing parity bits.

 ASCII, EBCDIC, UNICODE,

 DIGITAL LOGIC CIRCUITS: DIGITAL COMPUTERS,
 LOGIC GATES, UNIVERSAL GATES,
 BOOLEAN ALGEBRA
 MAP SIMPLIFICATION.

MODULE – 1- CA PROF. ANJALI SOMAN