Skip to main content
EnglandComputer ScienceSyllabus dot point

Why do computers use binary, and how does it relate to the numbers we use?

Understand the binary, denary and hexadecimal number bases, why computers use binary, and convert between binary and denary.

A focused answer to AQA GCSE Computer Science 3.3.1, covering the binary, denary and hexadecimal number bases, why computers use binary, and how to convert between binary and denary.

Generated by Claude Opus 4.88 min answer

Reviewed by: AI editorial process; not yet individually human-reviewed

Have a quick question? Jump to the Q&A page

Jump to a section
  1. What this dot point is asking
  2. The three number bases
  3. Why computers use binary
  4. Binary to denary
  5. Denary to binary
  6. Checking your conversions
  7. Try this

What this dot point is asking

AQA wants you to know the three number bases (binary, denary and hexadecimal), explain clearly why computers use binary, and convert between binary and denary in both directions, showing working.

The three number bases

The key idea behind every number base is positional notation. In denary the number 154 means 1Γ—100+5Γ—10+4Γ—11 \times 100 + 5 \times 10 + 4 \times 1, that is the digit in each column is multiplied by a power of ten. Binary works identically but with powers of two, so 1001101010011010 means 1Γ—128+0Γ—64+0Γ—32+1Γ—16+1Γ—8+0Γ—4+1Γ—2+0Γ—11 \times 128 + 0 \times 64 + 0 \times 32 + 1 \times 16 + 1 \times 8 + 0 \times 4 + 1 \times 2 + 0 \times 1. Understanding that the only thing that changes between bases is the base of the powers makes every conversion follow from one rule.

Why computers use binary

This reliability is the heart of the answer AQA wants. Storing ten distinguishable voltage levels in a circuit would make it sensitive to tiny fluctuations, so errors would be common; with only two levels there is a wide gap between "on" and "off" that noise cannot bridge. Binary also makes logic simple: AND, OR and NOT gates operate directly on 1s and 0s, so arithmetic and decision-making can be built from a few standard gates.

Binary to denary

The place values of an 8-bit binary number are 128, 64, 32, 16, 8, 4, 2, 1. Write them above the bits and add the place values where there is a 1.

Denary to binary

Start with the largest place value (128) and work down. If the value fits into what is left, write 1 and subtract it; otherwise write 0 and move on.

Checking your conversions

A quick way to catch errors is to convert back the other way. If you turn a denary number into binary, convert the binary straight back to denary by adding the place values; if it does not match, you have made a slip. Another useful check is the range: an 8-bit binary number can only represent 0 to 255, so any denary value above 255 cannot fit in eight bits, and any binary answer with a 1 in a place value beyond 128 has more than eight bits. Doing this check takes seconds and often saves a mark lost to a single misread digit.

Try this

Q1. Convert the binary number 0001011000010110 to denary. [2 marks]

  • Cue. 16+4+2=2216 + 4 + 2 = 22.

Q2. Explain why computers use binary rather than denary. [2 marks]

  • Cue. Components have two reliable states (on/off) that map to 1 and 0; a two-state system resists electrical noise, so storing data is reliable.

Exam-style practice questions

Practice questions written in the style of AQA exam questions on this dot point, with worked answer explainers. The year tag is the paper they imitate, not the source.

AQA 20183 marksConvert the 8-bit binary number 10011010 into denary. Show your working.
Show worked answer β†’

Write the place values above the bits: 128, 64, 32, 16, 8, 4, 2, 1. The bits are 1 0 0 1 1 0 1 01\,0\,0\,1\,1\,0\,1\,0, so 1s sit under 128, 16, 8 and 2.

Add those place values: 128+16+8+2=154128 + 16 + 8 + 2 = 154.

The answer is 154. Markers reward correct place values (the leftmost bit is worth 128, not 1), and full working so that one wrong digit does not lose every mark.

AQA 20213 marksConvert the denary number 201 into an 8-bit binary number. Show how you subtract the place values.
Show worked answer β†’

Work down from the largest place value that fits. 201βˆ’128=73201 - 128 = 73 (so 128 fits, write 1). 73βˆ’64=973 - 64 = 9 (64 fits, write 1). 32 and 16 do not fit (write 0, 0). 9βˆ’8=19 - 8 = 1 (8 fits, write 1). 4 and 2 do not fit (write 0, 0). 1βˆ’1=01 - 1 = 0 (1 fits, write 1).

Reading the bits gives 1100100111001001. A denary check confirms 128+64+8+1=201128 + 64 + 8 + 1 = 201.

Markers reward systematic subtraction from 128 downward, a full 8-bit answer (leading bits included), and a value that converts back correctly.

Related dot points

Sources & how we know this