Chapter 5 Binary Numbers

Tally marks, stones, sticks, etc. are used for collecting the data in statistics. All of these bear equal value irrespective of their positions. Such a system is known as non-positional number system. The number system in which specific symbols are given specific values and symbols which are used repeatedly in a number have been given different place values is known as positional number system. For example: Decimal number system, octal number system, binary number system, etc. The total number of digits used in a positional number system is called base or radix of that number system. The number system in which two digits 0 and 1 are used is called the binary number system. The base or radix of the binary number system is 2 because the total number of digits used in this system is 2. If we have a number in the binary system in the expanded form, then the number can be obtained by collecting only the coefficients of powers of 2. For example: 1 24 + 0 23 + 0 22 + 0 21 + 1 20 = (10001)2 In the binary system, every number is expressed by using only two digits 0 and 1. This is possible because each digit has been assigned weight (place values) in increasing order from right to left according to its position in the number expanded in binary system. The weights of the positions in the decimal number system are listed in the following table: 1,00,00,000s place 10,00,000s place 1,00,000s place 10,000s place 1,000s place 100s place 10s place Units place 107 106 105 104 103 102 101 100

The weights of the positions in the binary number system are listed in the following table:

128s place 64s place 32s place 16s place 8s place 4s place 2s place Units place

27 26 25 24 23 22 21 20

Positional value of a digit in a number expressed in binary system is the product of the digit and its positional weight. Example: What is the place value of 1 on the 32s place in the binary number 1110012? Solution: Positional value of 1 on 32s place = 1 25 = 1 32 = 32 Each digit in the decimal number is called dit. Example: 2, 8, 0 are dits in the number 28010. Each digit in the binary number is called bit. 1, 0, 1 are the bits in the number 1012. Conversion of decimal number into its binary equivalent Expansion method: In this method, the decimal number is divided into parts such that each part is a power of 2. For example: (35)10 = 32 + 2 + 1 = 25 + 21 + 20 = 1 25 + 0 24 + 0 23 + 0 22 + 1 21 + 1 20 = 1000112 Division-Remainder technique: In this method, we follow the below given steps. i. Divide the given decimal integer by 2. Record the quotient and remainder separately. ii. Divide the quotient obtained above by 2 and record the new quotient and remainder. Repeat this procedure till the quotient is zero.

iii.

Obtain the binary equivalent of the given decimal integer by first putting the last remainder at the leftmost position and then arranging all the remaining remainders in reverse order.

Example: Find the binary equivalent of 13410 by division-remainder technique. Solution: Base 2 2 2 2 2 2 2 2 Quotient 134 67 38 19 9 4 2 1 0 Remainder 0 1 0 1 1 0 0 1

13410 = 100110102 Conversion of a binary number to its decimal equivalent Example: Find the decimal equivalent of a binary integer 1012. Solution:
1012 1 22 0 21 1 20 1 4 0 2 1 1 4 0 1 510

Addition of binary numbers Properties of addition in the binary number system are as follows: I. II. III. IV. 0+0=0 0+1=1 1+0=1 1 + 1 = 10

Addition of binary numbers is similar to the addition of decimal numbers. Since 1 is the largest digit in the binary number system, any sum greater than 1 requires a digit to be carried over. Example: Add 11001 and 1011. Solution:
1 11 11001 Carry 1011 100100

Therefore, the addition of the given numbers is 1001002. Subtraction of binary numbers Properties of subtraction in the binary number system are as follows: I. II. III. IV. 00=0 10=1 11=0 10 1 = 1

Subtraction of binary numbers is similar to the subtraction of decimal numbers. In case of subtraction of binary numbers, we borrow 1 from the next higher column when we have to subtract 1 from 0. Example: Solve: 1100112 111112 Solution:

1100112 111112 = 101002

Contribute to this Revision Note: If you find anything of importance missing from this note, email it to us at revision-notes@meritnation.com, and well add it to this note under your name!