Binary Multiplication Explained for GCSE Computer Science

Why is binary multiplication important at GCSE?

AQA's GCSE Computer Science specification explicitly includes binary arithmetic — addition, subtraction, and multiplication. Understanding binary multiplication also reinforces two key ideas: how left shifts act as doubling, and how the CPU's arithmetic logic unit (ALU) performs multiplication using only its adder circuits and shift registers.

What is the shift-and-add method?

Binary multiplication mirrors long multiplication in decimal. You multiply the top number (multiplicand) by each digit of the bottom number (multiplier) in turn, shifting the partial product one place left for each successive digit, then sum the partial products.

Rule: If the multiplier bit is 1, write the multiplicand shifted into position. If the multiplier bit is 0, write a row of zeros.

Worked example: multiply 6 × 5 in binary

Step 1 — Convert to binary:

• 6 in binary: 0110
• 5 in binary: 0101

Step 2 — Write out the partial products (work right to left through the multiplier bits):

       0110   (multiplicand = 6)
    ×  0101   (multiplier = 5)
    --------
       0110   (bit 0 of multiplier is 1 → 0110 × 2⁰ = 0110, shift 0)
      0000    (bit 1 of multiplier is 0 → 0000,          shift 1)
     0110     (bit 2 of multiplier is 1 → 0110 × 2² = 11000, shift 2)
    0000      (bit 3 of multiplier is 0 → 0000,          shift 3)
    --------

Step 3 — Add the partial products:

      0000 0110
      0000 0000
      0001 1000
  +   0000 0000
  = ___________
      0001 1110

Step 4 — Convert back to decimal: 0001 1110 = 16 + 8 + 4 + 2 = 30 ✓ (since 6 × 5 = 30)

How do binary shifts connect to multiplication?

A left shift of one position is equivalent to multiplying by 2. Two left shifts multiply by 4. Three left shifts multiply by 8. In general, shifting left by k positions multiplies by 2^k.

This insight means that multiplying by powers of 2 requires only a shift operation — no addition needed. Multiplying by other numbers decomposes the multiplier into a sum of powers of 2.

For example, to multiply by 10 (= 8 + 2), shift left 3 and shift left 1, then add the two results: x × 10 = (x << 3) + (x << 1).

What is overflow and why does it matter in binary multiplication?

When you multiply two n-bit numbers, the result can require up to 2n bits. Multiplying two 4-bit numbers (maximum 15 × 15 = 225) needs up to 8 bits. If the result is stored back into a 4-bit register, the high bits are lost — this is overflow.

For this reason, multiplying registers in a real processor typically stores the result in a double-width register (e.g., two 32-bit registers to hold a 64-bit product).

How does a CPU actually perform multiplication?

Modern CPUs have dedicated multiplier circuits, but at an educational level, multiplication is explained as repeated shift-and-add:

1. Inspect the least-significant bit of the multiplier.
2. If it is 1, add the multiplicand (shifted to the appropriate position) to an accumulator.
3. Shift the multiplicand left by one position (or shift the multiplier right by one).
4. Repeat for each bit.

This is exactly what you do on paper. On hardware, the steps happen in nanoseconds using shift registers and the ALU's adder.

Frequently asked questions

Do I need to multiply multi-bit binary numbers in the GCSE exam?

AQA explicitly includes binary multiplication in its specification. You should be able to multiply two small binary numbers using the shift-and-add method and add the partial products. Numbers up to 8 bits each are typical in exam questions. OCR also references multiplication in the context of binary arithmetic and shifts.

Is there a quicker method for multiplying by a power of 2?

Yes — simply shift left. 0011 × 4 is just 0011 shifted left twice to give 1100. Recognising when a multiplier is (or can be decomposed into) powers of 2 lets you avoid writing out all the partial products. In the exam, if asked "what is 5 × 8 in binary?", you can convert 5 to 0101 and shift left three places to get 0010 1000 (= 40) directly.

What is the difference between a logical left shift and an arithmetic left shift?

For multiplication purposes both behave the same: bits shift left, zeroes fill from the right, and the leftmost bit is lost if it overflows. The distinction matters for right shifts when dealing with negative numbers (two's complement). A logical right shift fills with 0s; an arithmetic right shift fills with copies of the sign bit, preserving the sign. At GCSE, questions on multiplication usually use unsigned (positive) values, so the distinction does not arise.

Why do GCSE exams use 8-bit examples for binary multiplication?

Eight bits are the standard unit for GCSE data-representation questions because one byte represents the smallest addressable unit of memory. Eight-bit arithmetic is complex enough to test understanding without requiring an impractically large number of steps. In your answers, always show your partial products clearly and add them in a column — examiners award marks for method even if your final addition contains a slip.

---

Want to practise binary multiplication with step-by-step guidance and instant error checking? Professor Turing at aitutors.me will catch any slip in your partial products before it reaches your exam.