# Binary Number System

## Binary Number System

Binary number system is used by the digital computers and digital electronic devices. The binary (the prefix bi meaning two) number system uses only the two values: 0 and 1. The digit 0 is represented by **LOW** voltage and digit 1 is represented by **HIGH** voltage. This matches the capabilities of the transistor perfectly, as the transistor can also have only two states or values. The bonding of these two states allows the computer to use the binary number system. The computer stores a single binary numeral (either a one or a zero) in a single transistor. In fact, the word bit in computer language is a short form of binary digit. Each transistor holds a single electrical charge that is either positive or non-positive, which in turn represents a 1 or a 0.

A binary digit (either 0 or 1) is called a bit.

When you

saya binary number, pronounce each digit (example, the binary number “101″ is spoken as“one zero one”, or sometimes“one-oh-one”). This way people don’t get confused with the decimal number.

## Computing in Binary Numbers

The primary storage device inside the computer is the transistor that allows your computer to store and process millions of bits of data. A single transistor is capable of holding an electrical charge that is either positive or non-positive (0 or 1 sometimes). Since the objective of the computer is to manipulate data, the electrical states of the transistor (positive and non-positive) are assigned the numerical values of 1 and 0 (zero).

## Bit

A **bit** is a binary digit, taking a value of either 0 or 1. For example, the number 10010111 is 8 bits long. Binary digits are a basic unit of information storage and communication in digital computing and digital information theory.

## Byte

Eight bits are grouped together to form what is called a byte. A byte can store smaller integer numbers or a single character. The eight bits of a byte can create 255 different values in the binary number system.

## Kilobytes

A kilobyte (derived from the *kilo-*, meaning 1,000) is a unit of information or computer storage equal to 1,024 bytes (2^{10}). It is commonly abbreviated KB..

## Megabytes

A megabyte is a unit of information or computer storage equal to 1,048,576 bytes ie 1024 kilobytes. It is commonly abbreviated as MB.

## Gigabytes

A gigabyte is a unit of information or computer storage equal to 1024 megabytes. It is commonly abbreviated as GB.

** **

Bits: 1 and 0

8 bits=1 byte

1024 bytes = 1 Kilobyte (KB)

1024 kilobytes = 1 Megabyte (MB)

1024 megabytes = 1 Gigabyte (GB)

1024 Gigabytes = 1 Terabyte (TB)

Similarly, 1024 TB = 1 Petabyte (PB)

1024 PB = 1 Exabyte (EB)

1024 EB = 1 Zettabyte (ZB)

1024 ZB = 1 Yottabyte (YB)

** **

## Counting in Binary System

Counting in Binary is similar to as other number system. As in Decimal we start counting from 0 to 9 and after 9 we again start with 10 and so on after 99,999 and continue, in binary number system we use combination of only two bits 0 and 1. The first 15 number in number system are counted in binary as shown in table picture.

When the symbols for the first digit are exhausted, the next-higher digit (to the left) is incremented, and counting starts over at 0. In decimal, counting proceeds like so:

000, 001, 002, … 007, 008, 009, (rightmost digit starts over, and next digit is incremented)

0**1**0, 011, 012, …

…

090, 091, 092, … 097, 098, 099, (rightmost two digits start over, and next digit is incremented)

**1**00, 101, 102, …

## Addition in Binary Number System

The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple, using a form of **carrying**:

## X |
## Y |
## X+Y |

0 |
0 |
0 |

0 |
1 |
1 |

1 |
0 |
1 |

1 |
1 |
10 with sum 0 and carry 1 |

Adding two “1″ digits produces a digit “0″, while 1 will have to be added to the next column as a carry.

**Example:**

In this example two binary numerals are being added (10110101)_{2} and (01010110)_{2}. The top row shows the carry bits. While carry is obtained the 1 is carried to the left, and the 0 is written at the bottom.

## Subtraction in Binary Number System

Similar to decimal subtraction, to subtract a binary number from other we need to subtract a corresponding bit from other. The result of subtraction of a bit from other is given in following table.

## X |
## Y |
## X-Y |

0 |
0 |
0 |

0 |
1 |
1 with difference 1 and borrow 1 |

1 |
0 |
1 |

1 |
1 |
0 |

Subtracting a “1″ digit from a “0″ digit produces the digit “1″, while 1 will have to be subtracted from the next column. This is known as ** borrowing.** The principle is the same as for carrying. When the result of a subtraction is less than 0, the least possible value of a digit, the procedure is to “borrow” the deficit divided by the radix (that is, 10/10) from the left, subtracting it from the next positional value.

**Example:**

Apart from this subtraction method digital computer uses complement methods for subtraction. We will definitely cover more about Complements in coming articles.

See more about : De-Morgan’s Theorem