1. Binary Addition
Rule – Bit-by-Bit Addition
| carry-in | Sum bit | Carry-out | ||
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
In words: (write 0, carry 1) and (write 1, carry 1).
Vocabulary: augend + addend = sum.
Example – No Carry
0 1 1 0 0 (12)
+ 1 0 0 0 1 + (17)
-----------
1 1 1 0 1 (29)
Example – With Carries
carry 1 1 1 1
1 0 1 1 0 (22)
+ 1 0 1 1 1 + (23)
-----------
1 0 1 1 0 1 (45)
The final carry out of the MSB becomes a new leading bit, so the sum has one more bit than the operands.
Example – Fractional Numbers
Align the binary points, then add normally:
1 0 1 . 1 0 (5.5)
+ 1 0 1 . 1 1 + (5.75)
-------------
1 0 1 1 . 0 1 (11.25)
2. Binary Subtraction
Rule – Bit-by-Bit Subtraction
| Difference | Borrow | ||
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 (borrow from the next column) |
Borrowing from the next column brings in , so becomes .
Vocabulary: minuend − subtrahend = difference.
If , compute : subtract the smaller from the larger and attach a minus sign.
Example – No Borrow
1 0 1 1 0 (22)
- 1 0 0 1 0 - (18)
-----------
0 0 1 0 0 (4)
Example – With Borrows
1 0 1 1 0 (22)
- 1 0 0 1 1 - (19)
-----------
0 0 0 1 1 (3)
Column 0: needs a borrow → the bit-1 column lends, becoming 0, and column 0 becomes . Column 1: now → borrow again from column 2 → . Column 2: the 1 was lent, .
Example – Fractional Numbers
1 0 1 . 1 0 (5.5)
- 1 0 1 . 0 1 - (5.25)
-------------
0 0 0 . 0 1 (0.25)
⚠️ Every borrow propagates left until it reaches a 1. A chain of 0s turns into 1s as the borrow passes through them (e.g. ).
3. Binary Multiplication
Rule – Multiplication Table
Each partial (intermediate) product is either a copy of the multiplicand (multiplier bit = 1) or all zeros (bit = 0), shifted one position per row. Then add the partial products.
Example –
1 0 1 1 multiplicand (11)
× 1 0 1 multiplier (5)
---------
1 0 1 1 ← bit 0 = 1
0 0 0 0 ← bit 1 = 0
1 0 1 1 ← bit 2 = 1
-----------
1 1 0 1 1 1 product (55)
flowchart LR M["Multiplicand 1011"] --> P0["× bit0=1 → 1011"] M --> P1["× bit1=0 → 0000, shift 1"] M --> P2["× bit2=1 → 1011, shift 2"] P0 --> S["Add partial products"] P1 --> S P2 --> S S --> R["110111 = 55"]
Example – Fractional Numbers:
Multiply as integers (), then place the point: total fractional digits .
⚠️ The slide writes ; the correct decimal value of is .
Special Case – Multiplying by
Append zeros on the right (shift left by positions):
| Operation | Result | Factor |
|---|---|---|
4. Binary Division
Rule – Long Division
Same as decimal long division, but each quotient digit is only 0 or 1: at each step, check whether the divisor “fits” in the current partial remainder — if yes write 1 and subtract, else write 0 and bring down the next bit.
Example –
1 0 1 1 1 0 quotient
----------------
101 ) 1 1 1 0 0 1 1 1
-1 0 1
-----
1 0 0 0
- 1 0 1
-------
1 1 1
- 1 0 1
-------
1 0 1
- 1 0 1
-------
0 0 0 1 remainder
Example – Fractional Dividend
Special Case – Dividing by
Delete the rightmost digits (shift right by ); the deleted bits are the remainder:
| Operation | Quotient | Divisor |
|---|---|---|
⚠️ Deleting bits gives the integer quotient. To keep the exact value, move the binary point left instead: .
Exercises: none assigned in this chapter’s slides — redo each worked example and check it in decimal.