Computer Arithmetic

Binary over Decimal

 Information is handled in a computer by electronic/

electrical components
 Electronic components operate in binary mode (can
only indicate two states – on (1) or off (0)
 Binary number system has only two digits (0 and 1),
and is suitable for expressing two possible states
 In binary system, computer circuits only have to handle
two binary digits rather than ten decimal digits causing:
 Simpler internal circuit design
 Less expensive
 More reliable circuits
 Arithmetic rules/processes possible with binary
numbers
Examples of a Few Devices that work in
Binary Mode

Binary On (1) Off (0)

State

Bulb

Switch

Circuit
Pulse
Binary Arithmetic

 Binary arithmetic is simple to learn as binary number

system has only two digits – 0 and 1

 Following slides show rules and example for the four

basic arithmetic operations using binary numbers
Binary Addition

Rule for binary addition is as follows:

0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 0 plus a carry of 1 to next higher column
Binary Addition (Example 1)
Example
Add binary numbers 10011 and 1001 in both decimal and
binary form

Solution

Binary Decimal

carry 11 carry 1
10011 19
+1001 +9

11100 28

In this example, carry are generated for first and second columns
Binary Addition (Example 2)

Example

Add binary numbers 100111 and 11011 in both decimal

and binary form

Solution
The addition of three 1s
Binary Decimal can be broken up into two
steps. First, we add only
carry 11111 carry 1 two 1s giving 10 (1 + 1 =
10). The third 1 is now
added to this result to
100111 39
obtain 11 (a 1 sum with a 1
+11011 +27 carry). Hence, 1 + 1 + 1 =
1, plus a carry of 1 to next
1000010 66 higher column.
Binary Subtraction

Rule for binary subtraction is as follows:

0 - 0 = 0
0 - 1 = 1 with a borrow from the next column
1 - 0 = 1
1 - 1 = 0
Binary Subtraction (Example)

Example

Subtract 011102 from 101012

Solution

12
0202
10101
-01110

00111

Note: Go through explanation given in the book

Complement of a Number

Number of digits
in the number

C = Bn - 1 - N

Complement Base of the The number

of the number number
Complement of a Number (Example 1)

Example

Find the complement of 3710

Solution

Since the number has 2 digits and the value of

base is 10,
(Base)n - 1 = 102 - 1 = 99
Now 99 - 37 = 62

Hence, complement of 3710 = 6210

Complement of a Number (Example 2)

Example
Find the complement of 68

Solution
Since the number has 1 digit and the value of
base is 8,
(Base)n - 1 = 81 - 1 = 710 = 78
Now 78 - 68 = 18

Hence, complement of 68 = 18
Complement of a Binary Number

Complement of a binary number can be obtained by

transforming all its 0’s to 1’s and all its 1’s to 0’s

Example
Complement of 1 0 1 1 0 1 0 is

0 1 0 0 1 0 1

Note: Verify by conventional complement

Complementary Method of Subtraction

Involves following 3 steps:

Step 1: Find the the number you

complement of are
subtracting (subtrahend)
from which you
Step 2: Add this to
the number are
taking away (minuend) add it to obtain
the result; if there is no carry, recomplement the
Step sum
3: If and attach
there is a acarry
negative
of sign
1,

Complementary subtraction is an additive approach of subtraction

Complementary Subtraction (Example 1)

Example:
Subtract 5610 from 9210 using complementary method.

Solution
Step 1: Complement of 5610
= 102 - 1 - 56 = 99 – 56 = 4310 The result may be
verified using the
Step 2: 92 + 43 (complement of 56) method of normal
= 135 (note 1 as carry) subtraction:

Step 3: 35 + 1 (add 1 carry to sum) 92 - 56 = 36

Result = 36
Complementary Subtraction (Example 2)

Example
Subtract 3510 from 1810 using complementary method.
Solution

Step 1: Complement of 3510 Step 3: Since there is no carry,

= 102 - 1 - 35 re-complement the sum and
= 99 - 35 attach a negative sign to
= 6410 obtain the result.

Result = -(99 - 82)

Step 2: 18 = -17
+ 64 (complement
of 35) The result may be verified using normal
82 subtraction:

18 - 35 = -17
Binary Subtraction Using Complementary Method
(Example 1)

Example
Subtract 01110002 (5610) from 10111002 (9210) using
complementary method.

Solution
1011100
+1000111 (complement of 0111000)

10100011

1 (add the carry of 1)

0100100

Result = 01001002 = 3610

Binary Subtraction Using Complementary Method
(Example 2)

Example
Subtract 1000112 (3510) from 0100102 (1810) using
complementary method.

Solution
010010
+011100 (complement of 100011)

101110

Since there is no carry, we have to complement the sum and

attach a negative sign to it. Hence,

Result = -0100012 (complement of 1011102)

= -1710
Binary Multiplication

Table for binary multiplication is as follows:

0x0=0
0x1=0
1x0=0
1x1=1
Binary Multiplication (Example 1)
Example

Multiply the binary numbers 1010 and 1001

Solution
1010 Multiplicand
x1001 Multiplier

1010 Partial Product

0000 Partial Product
0000 Partial Product
1010 Partial Product

1011010 Final Product

(Continued on next slide)
 Binary Multiplication (Example 2)
(Continued from previous slide..)

Whenever a 0 appears in the multiplier, a separate partial

product consisting of a string of zeros need not be generated
(only a shift will do). Hence,

1010 x1001

1010
1010SS (S = left shift)

1011010
Binary Division

Table for binary division is as follows:

1  0 = Divide by zero error 0  1 = 0

2  0 = Divide by zero error 1  1 = 1

As in the decimal number system (or in any other number

system), division by zero is meaningless

The computer deals with this problem by raising an error

condition called ‘Divide by zero’ error
Rules for Binary Division

1. Start from the left of the dividend

2. Perform a series of subtractions in which the divisor is
subtracted from the dividend
3. If subtraction is possible, put a 1 in the quotient and
subtract the divisor from the corresponding digits of
dividend
4. If subtraction is not possible (divisor greater than
remainder), record a 0 in the quotient
5. Bring down the next digit to add to the remainder
digits. Proceed as before in a manner similar to long
division
Binary Division (Example 1)

Example

Divide 1000012 by 1102

Solution 0101 (Quotient)

110 100001 (Dividend)

110 1 Divisor greater than 100, so put 0 in quotient
1000 2 Add digit from dividend to group used above
110 3 Subtraction possible, so put 1 in quotient

100 4 Remainder from subtraction plus digit from dividend

110 5 Divisor greater, so put 0 in quotient
1001 6 Add digit from dividend to group
110 7 Subtraction possible, so put 1 in quotient
11 Remainder
Additive Method of Multiplication and Division

Most computers use the additive method for performing

multiplication and division operations because it simplifies
the internal circuit design of computer systems

Example
4 x 8 = 8 + 8 + 8 + 8 = 32
Rules for Additive Method of Division

 Subtract the divisor repeatedly from the dividend until

the result of subtraction becomes less than or equal to
zero
 If result of subtraction is zero, then:
 quotient = total number of times subtraction was
performed
 remainder = 0
 If result of subtraction is less than zero, then:
 quotient = total number of times subtraction was
performed minus 1
 remainder = result of the subtraction previous to
the last subtraction
Additive Method of Division (Example)

Example
Divide 3310 by 610 using the method of addition

Solution:
33 - 6 = 27
27 - 6 = 21 Since the result of the last
21 - 6 = 15 subtraction is less than zero,
15 - 6 = 9
9-6= 3 Quotient = 6 - 1 (ignore last
3 - 6 = -3 subtraction) = 5

Total subtractions = 6 Remainder = 3 (result of previous

subtraction)