# Binary Number Operations Welcome to the fundamental world of binary numbers, the backbone of all digital technology! Understanding binary is crucial for anyone looking to grasp how computers process information. This study material will guide you through the basics of the binary system and essential arithmetic operations like addition and subtraction using complements. ## Introduction to Binary Numbers The **binary number system**, also known as the **base-2 system**, is the primary language of all modern digital computers and electronic devices. Unlike our everyday decimal (base-10) system, which uses ten unique digits (0-9), the binary system simplifies things by using only **two digits**: $0$ and $1$. These digits are called **bits** (binary digits). Each position in a binary number holds a value that is a power of two, much like each position in a decimal number represents a power of ten. For instance, the decimal number $5$ is represented as $101_2$ in binary. To convert $101_2$ to decimal, we use the following calculation: $$(1 \times 2^2) + (0 \times 2^1) + (1 \times 2^0) = 4 + 0 + 1 = 5$$ Understanding how to perform arithmetic operations in binary is essential for grasping the internal workings of computers, as all calculations, from simple additions to complex algorithms, are ultimately broken down into these basic binary operations. > ### Bit > A **bit** is the smallest unit of data in a computer, representing a binary digit, either $0$ or $1$. Did you know that the word "bit" was coined by John Tukey in 1946, a brilliant statistician and computer scientist, as a shorthand for "binary digit"? ## Binary Addition Binary addition follows a set of simple rules, very similar to decimal addition, but limited to just two digits. When adding binary numbers, we perform column addition, starting from the rightmost (least significant) bit and moving leftward. ### Basic Rules for Adding Two Binary Digits (Bits): 1. $0 + 0 = 0$ 2. $0 + 1 = 1$ 3. $1 + 0 = 1$ 4. $1 + 1 = 10_2$ (This means $0$ with a **carry** of $1$ to the next column). When a carry is generated, it is added to the bits in the next column to the left, exactly as in decimal addition. If there are three bits to add in a column (two original bits plus a carry-in from the previous column), the rules extend as follows: ### Rules for Adding Three Binary Digits: 1. $0 + 0 + 0 = 0$ 2. $0 + 0 + 1 = 1$ 3. $0 + 1 + 0 = 1$ 4. $0 + 1 + 1 = 10_2$ ($0$ with a carry of $1$) 5. $1 + 0 + 0 = 1$ 6. $1 + 0 + 1 = 10_2$ ($0$ with a carry of $1$) 7. $1 + 1 + 0 = 10_2$ ($0$ with a carry of $1$) 8. $1 + 1 + 1 = 11_2$ ($1$ with a carry of $1$) ### Example: Binary Addition Let's add the binary numbers $1011_2$ (decimal $11$) and $0101_2$ (decimal $5$). ``` ¹ ¹ ← Carry bits 1011₂ + 0101₂ ------- 10000₂ ``` #### Step-by-step explanation: 1. **Rightmost column ($2^0$ position):** $1 + 1 = 10_2$. We write down $0$ and carry over $1$ to the next column. 2. **Second column ($2^1$ position):** $1$ (carry) $+ 1 + 0 = 10_2$. We write down $0$ and carry over $1$. 3. **Third column ($2^2$ position):** $1$ (carry) $+ 0 + 1 = 10_2$. We write down $0$ and carry over $1$. 4. **Leftmost column ($2^3$ position):** $1$ (carry) $+ 1 + 0 = 10_2$. We write down $0$ and carry over $1$. 5. **Final carry:** The last carry bit, $1$, is placed in the leftmost position, resulting in $10000_2$. So, $1011_2 + 0101_2 = 10000_2$. Converting to decimal, $11 + 5 = 16$, which is indeed $10000_2$ ($1 \times 2^4 = 16$). ## Overflow in Addition In digital systems, numbers are typically represented using a fixed number of bits (e.g., $4$-bit, $8$-bit, $16$-bit, or $32$-bit). This fixed size limits the range of numbers that can be represented. An **overflow** occurs when the result of an arithmetic operation exceeds the maximum value that can be stored within the allocated number of bits. > ### Overflow > An **overflow** happens when the result of an arithmetic operation is too l