The Binary Numbering System

The numbering system is a way of representing numbers. The numbering system that is commonly used
3
is called the decimal numbering system because it uses 10 symbols – 7,216 is understood as 7 x 10 +
2 1 0
2 x 10 + 1 x 10 + 6 x 10 or 7,000 + 200 + 10 +6 or 7,216. The binary numbering system uses only two
3 2 1 0
symbols’ digits 0 and 1 – 1001 represents (1 x 2 + 0 x 2 + 0 x 2 + 1 x 2 or 8 + 1 or 9). In both systems,
the position of each digit determines the power, or exponents, to which the base number (10 for
decimal and 2 for binary) is raised.

Binary to Decimal Conversion System

To convert a base 2 number to base 10, you must know the decimal equivalent of each power of
2. The decimal value of a power of 2 is obtained by multiplying 2 by itself the number of times
indicated by the exponent for whole numbers.

Rule: To obtain the decimal value of a binary number, add the powers of two (2) corresponding to
those bits of the number being converted whose value is one (1).
1. In converting binary into decimal, use the expanded notation. 1012 = ?10
2 1 0
2. Any number rises to zero (0) that is equal to (1). (1x2) +(0x2) +(1x2)
3. Before you add the value of each binary digit, first raise it to the power
of then multiply. 4+0+1
4. Afterward, add all the values which is the result of raising all
power of each digit 510

Example:

a. 1012 = ?10
= (1X2)2 + (0X2)1 + (1X2)0
= 4+0+1
= 510

NOTE: Do this using a yellow sheet/paper.

Practice Exercise: Find the decimal equivalent of the following binary number. Show your solution.

1. 10102 = ?10
2. 0112 = ?10
3. 11102 = ?10
4. 1112 = ?10
5. 10012 = ?10

MDAS Binary Operation

1. Binary Addition

Addition is a form of counting in which one quantity is added to another. The following
definitions identify the basic terms of addition:
▪ Augend is the quantity to which an addend is added Addend a number to be added
to a preceding number Sum is the result of an addition (the sum of 5 and 7 is 12)
▪ Carry is produced when the sum of two or more digits in a vertical column equals or
exceeds the base of the number system in use.

1|Page
Let's start by adding two binary bits. Since each bit has only two possible values, 0 or 1, there are only
four possible combinations of inputs. These four possibilities, and the resulting sums, are:

0+0= 0
0+1= 1
1+0= 1
1 + 1 = 0 plus a carryover of 1
To add numbers, you can either count two digits in sequence or you can simply remember the results of
adding the four possible combinations of digits, as given in the addition table. Carryover are performed in
the same manner as in decimal arithmetic. Since 1 is the largest digit in the binary system, a sum greater
than 1 requires that a digit be carried over.

Similarly, the addition of binary fractions is carried out in the same manner as the addition of binary
integers, and when more than two binary numbers are added, the numbers accumulate to a running
total at a time. We do not use the same technique as with decimal numbers since that would involve an
exorbitant amount of carrying over.

Like decimal addition, when the sum in one column is a two-bit (two-digit) number, the least significant figure
is written as part of the total sum, and the most significant figure is "carried" to the next left column. Consider
the following examples:

Examples # 1

Add 10112 and 11012. Solution: Write out the problem as shown:

As we noted previously, the sum of 1 and 1 is 2, which cannot be expressed as a single digit in the
binary system. Therefore, the sum of 1 and 1 produces a carry:

The following steps, with the carry indicated, show the completion of the addition’

In the final step, the remaining carry is brought down to the sum. When the carry is added, it is marked
through to prevent adding it twice.

2|Page
NOTE: Do this using a yellow sheet/paper.

Practice Exercise: Find the summation of the following binary number. Show your solution.

1. 112 + 102 = ?2
2. 0112 + 1012 = ? 2
3. 11102 + 10112 = ? 2
4. 1112 + 102 + 102 = ? 2
5. 10012 + 11112 = ? 2

Binary Subtractions

Subtraction is generally simpler than addition since only two numbers are involved and the upper value
representation is greater than the lower value representation. The problem of "borrow" is similar in binary
subtraction to that in decimal. We can construct a subtraction table that has two parts - the three cases of
subtracting without borrow, and the one case of the involvement of a borrow digit, no matter how far to
the left is the next available binary digit.

The following definitions identify the basic terms you will need to know to understand subtraction
operations:

Subtract To take away, as a part from the whole or one number from another
Minuend The number from which another number is to be subtracted
Subtrahend The quantity to be subtracted.
Remainder, or Difference that which is left after subtraction
Borrow To transfer a digit (equal to the base number) from the next higher-order column for the
purpose of subtraction.

Rules:
0–0=0
1–0=1
1–1=0
0 – 1 = 0 with a borrow of 1

Here are some examples of binary subtraction. These are computed without regard to the word size, hence there
can be no sense of "overflow" or "underflow". Work the columns right to left subtracting in each column. If you
must subtract a one from a zero, you need to “borrow” from the left, just as in decimal subtraction.

Example: 1011011 − 10010 = 1001001:

1 0 1 1 0 1 1
– 1 0 0 1 0
1 0 0 1 0 0 1

NOTE: Do this using a yellow sheet/paper.

Practice Exercise: Subtract the following binary number. Show your solution.

1. 10102 - 102 = ?2
2. 11102 - 11012 = ? 2
3. 111q2 - 10012 = ? 2
4. 1012 - 1112 = ? 2
5. 10002 - 11112 = ? 2

3|Page