Binary Arithmetic – Addition, Subtraction, Multiplication & Division

Binary arithmetic forms the backbone of every digital computer. All processors perform calculations using just two digits — 0 and 1. Understanding how addition, subtraction, multiplication, and division work in binary is essential for designing ALUs, adders, and other computational circuits.

Why Binary Arithmetic Matters

Every calculation your computer performs — from rendering a webpage to running a machine learning model — ultimately reduces to binary arithmetic operations happening inside the processor. The Arithmetic Logic Unit (ALU) uses binary adders, subtractors, and shift operations to carry out all mathematical tasks.

Binary Subtraction

Direct Subtraction Method

Example: Subtract 1010 - 0111

Subtraction Using 2's Complement (Preferred Method)

To compute A - B:

1. Find the 2's complement of B
2. Add A + (2's complement of B)
3. If there's a carry out, the result is positive (discard carry)
4. If no carry out, the result is negative (take 2's complement of result)

Example: 1010 - 0111 using 2's complement

Example: 0100 - 0111 (negative result)

Binary Multiplication

Binary multiplication works like decimal long multiplication but is simpler since you only multiply by 0 or 1.

Rules

Example: Multiply 1101 × 1010

Verification: 13 × 10 = 130 ✓

Binary Division

Binary division uses repeated subtraction, similar to long division in decimal.

Example: Divide 1101 ÷ 10

Result: 1101 ÷ 10 = 110 remainder 1 (i.e., 13 ÷ 2 = 6 remainder 1) ✓

Overflow in Binary Arithmetic

Overflow occurs when the result of an arithmetic operation exceeds the range representable with the given number of bits.

Detecting Overflow (Signed Numbers)

• Adding two positive numbers gives a negative result → overflow
• Adding two negative numbers gives a positive result → overflow
• Adding a positive and negative number → never overflows

Example (4-bit signed): Range: -8 to +7

Arithmetic Circuit Diagram

Summary Table

Interview Questions

Q1: Why do computers use 2's complement for subtraction instead of direct subtraction?

2's complement converts subtraction into addition, allowing the same adder circuit to perform both operations. This simplifies hardware design — you don't need a separate subtractor circuit.

Q2: What is overflow and how is it detected in signed binary addition?

Overflow occurs when the result exceeds the representable range. It's detected by checking if the carry into the MSB differs from the carry out of the MSB (XOR of last two carries = 1 means overflow).

Q3: Can binary multiplication result in more bits than either operand?

Yes. Multiplying two n-bit numbers can produce a result up to 2n bits long. For example, two 4-bit numbers can give an 8-bit result.

Q4: Explain the Booth's multiplication algorithm briefly.

Booth's algorithm handles signed multiplication efficiently by examining pairs of bits in the multiplier. It adds the multiplicand for 01 transitions, subtracts for 10 transitions, and does nothing for 00 or 11. This reduces the number of additions needed.

Q5: What happens when you add 1 to the maximum positive number in n-bit 2's complement?

It wraps around to the most negative number. For example, in 4-bit: 0111 (+7) + 0001 (+1) = 1000 (-8). This is overflow.