🎓 Learning Journey · Topic 1.2A · Cornerstone

Your journey through Binary Operations

Binary addition with visible carries, and overflow in the mark-scheme phrasing. Seven stages from theory to mastery. Click any stage card to dive in — or continue where you left off.

Your progress

Where you are in Topic 1.2A

0 / 7Stages visited
0%Accuracy
0 / 10Mastery checklist
🎯 Recommended next stage

Start with Book Notes

Read the theory and terminology to get grounded.

The 7 stages

Choose any stage

Green cards are stages you've already visited. Grey cards are new territory. Click any card to jump straight to that stage.

📚 Topic 1.2A · Data Representation · Cornerstone

Binary Operations — addition & overflow

Add two 8-bit binary numbers using column-by-column carrying, and recognise when a result overflows the 8-bit range. Cambridge IGCSE 0478 Paper 1.

🧪 Cambridge Exam Mode ON — hints hidden, feedback delayed, model answers locked until marking.
§1 · Topic overview

What is Topic 1.2A?

Once you can read and write binary (1.1A), the next step is to add two binary numbers — column by column, right to left, carrying just like denary but at a 2-column boundary instead of 10. Cambridge test this every session on Paper 1, always with the phrase "show all your working".

Adding two 8-bit numbers can produce a result that needs 9 bits — the extra bit has nowhere to go, so an overflow occurs. Recognising overflow and explaining it in the mark-scheme's exact phrasing is the second half of this lesson.

Note: logical binary shifts and two's complement negative numbers are covered in 1.2B Shifts & Negative Numbers. This lesson (1.2A) covers addition and overflow only.

§2 · Learning objectives

By the end of 1.2A you can…

  • State the 5 binary addition rules from memory (0+0, 0+1, 1+0, 1+1, 1+1+1)
  • Add two 8-bit binary numbers using the column method, right to left
  • Show all carries clearly above the appropriate columns (mark-scheme requirement)
  • Define overflow in the mark-scheme's exact phrasing: "too large to represent in the number of bits available"
  • Detect when an addition will overflow (result > 255 in 8-bit)
  • Explain why converting to denary to add does not earn method marks
  • Handle columns with three 1s (1 + 1 + 1 = 11, write 1 carry 1)
  • Answer Cambridge-style addition and overflow questions with full working
§3 · Key terminology

Cambridge-approved terms

TermDefinition
Binary additionAdding two binary numbers column by column, right to left, using carry rules.
CarryWhen a column's sum is 2 or 3, a 1 is passed to the next column left.
SumThe digit written in the current column (0 or 1 after any carries).
Column methodThe right-to-left, column-by-column approach — the required method.
OverflowAn error that occurs when the result is too large to represent in the number of bits available.
RegisterA fixed-size storage location. An 8-bit register holds 8 bits — no more, no less.
MSB / 9th bitMost Significant Bit. When an 8-bit addition needs a 9th bit, that bit is lost.
8-bit range0 to 255 (unsigned). Result > 255 = overflow.
Show workingCambridge award method marks per step — must be shown in binary, not denary.
§4 · Core theory

The three tables you must know cold

The 5 addition rules

RuleSumCarry to next column
0 + 000 (no carry)
0 + 110 (no carry)
1 + 010 (no carry)
1 + 101 (carry)
1 + 1 + 111 (carry)

Overflow condition

Bits availableMax unsigned valueOverflow occurs when…
4-bit15 (1111)result > 15
8-bit255 (11111111)result > 255
16-bit65535 (1111 1111 1111 1111)result > 65535

Working direction

StepWhat happens
1Line up the two numbers, right-aligned
2Start at the rightmost column (LSB, place value 1)
3Apply the rule for that column, including any incoming carry
4Write any outgoing carry above the next column left
5Move one column left. Repeat until all columns processed
6If a final carry falls off the left edge in an 8-bit register → overflow
§5 · Worked examples

Watch each addition done step by step

Worked example 1 · Simple addition (single carry)

Add 00110101 + 00100011.

Carries: 1 0 0 1 1 0 1 0 1 + 0 0 1 0 0 0 1 1 ───────────────── = 0 1 0 1 1 0 0 0 Right-to-left: Col 1 (LSB): 1+1 = 10 → write 0, carry 1 Col 2: 0+1+1 = 10 → write 0, carry 1 Col 3: 1+0+1 = 10 → write 0, carry 1 Col 4: 0+0+1 = 1 → write 1, no carry Col 5: 1+0 = 1 Col 6: 1+1 = 10 → write 0, carry 1 Col 7: 0+0+1 = 1 Col 8: 0+0 = 0 Answer: 01011000 (denary check: 53 + 35 = 88 ✓)

Worked example 2 · Multi-column carries

Add 10011011 + 00010011.

Carries: 1 1 1 1 1 0 0 1 1 0 1 1 + 0 0 0 1 0 0 1 1 ───────────────── = 1 0 1 0 1 1 1 0 Right-to-left: Col 1: 1+1 = 10 → write 0, carry 1 Col 2: 1+1+1 = 11 → write 1, carry 1 Col 3: 0+0+1 = 1 → write 1, no carry Col 4: 1+0 = 1 → write 1 Col 5: 1+1 = 10 → write 0, carry 1 Col 6: 0+0+1 = 1 Col 7: 0+0 = 0 Col 8: 1+0 = 1 Answer: 10101110 (denary check: 155 + 19 = 174 ✓) No overflow (174 ≤ 255).

Worked example 3 · Overflow (9th bit lost)

Add 11111111 + 00000001.

Carries: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 + 0 0 0 0 0 0 0 1 ───────────────── (1) 0 0 0 0 0 0 0 0 Every column carries. A final carry of 1 falls off the left edge — the 9th bit has nowhere to go in an 8-bit register. Denary check: 255 + 1 = 256. 256 cannot fit in 8 bits (max is 255). Result: OVERFLOW. Register shows 00000000 (incorrect).
§6 · Common misconceptions

Traps that cost marks every session

Trap · Converting to denary to add

Converting both numbers to denary, adding in denary, then converting back does NOT demonstrate binary addition. Cambridge require binary working with carries visible. Method marks lost.

Cited: 2023 examiner report — "some candidates converted the values to denary, added the values and converted the answer back to binary. Candidates should note that this is not [the required method]"

Trap · Carries not shown clearly

Even if the final answer is correct, you lose method marks if the carries aren't visible above the appropriate columns. Write them explicitly.

Cited: 2025 examiner report — "candidates need to make sure they are clearly showing where the carries are located"

Trap · Overflow not identified

If a question asks whether overflow occurs, you must explicitly state so. Just giving a wrong 8-bit answer without flagging overflow scores zero.

Cited: 2023 examiner report — "many candidates were able to recognise that an overflow error occurs when the value is larger than…"

Trap · Overflow defined too vaguely

Saying "the answer is too big" is not enough. The mark-scheme wants "too large to represent in the number of bits available". Reference the bits.

Cited: 2025 examiner report — recurring definition phrasing

Trap · 1 + 1 written as 2

There is no digit 2 in binary. 1 + 1 = 10 (write 0, carry 1). Students familiar with denary sometimes write "2" and lose the mark.

Cited: recurring pattern

Trap · 1 + 1 + 1 written as 10 instead of 11

In a column with two 1s AND a carry-in of 1, the sum is 3 (denary) = 11 (binary). Write 1, carry 1. Students often write 10 instead.

Cited: recurring 8-bit multi-carry mistake

Trap · Answer given in denary

If the question asks for the answer in binary, give binary. Some candidates give a denary answer at the end even though their working was in binary. Read the wording.

Cited: 2023–2025 recurring wording trap

Trap · Column alignment errors

Write the two numbers with LSBs aligned to the right. A one-column misalignment cascades through every place value and produces a completely wrong answer.

Cited: recurring exam technique flag

Trap · Dropping the 9th bit silently

When the addition produces a 9th bit, don't just write the last 8 bits and move on. Explicitly identify this as overflow — that's the mark-scheme point.

Cited: recurring in overflow-explanation questions
§7 · Cambridge exam focus

Mark-scheme templates

These are the exact phrasings Cambridge accept. Learn them.

"1 + 1 = 10 (write 0, carry 1)" — recall this rule and the 1+1+1 = 11 rule
"Overflow occurs when the answer is too large to represent in the number of bits available" — the definition
"Carries shown above the appropriate columns" — mark-scheme working requirement
"For 8-bit: overflow occurs when the result is greater than 255 (needs a 9th bit)"
Never write: 1+1=2 · convert to denary · answer without carries
§8 · Quick knowledge check

Check yourself — tap to reveal (0/6)

Answer these in your head, then tap to see the model answer. Aim for 5 or 6 right before moving on.

Q1 · What is 1 + 1 in binary?
10 — write 0, carry 1. There is no digit 2 in binary.
Q2 · What is 1 + 1 + 1 in binary?
11 — write 1, carry 1. (Two ones plus a carry-in from the previous column.)
Q3 · Define overflow using the mark-scheme phrasing.
"The answer is too large to be represented in the number of bits available."
Q4 · What is the maximum 8-bit unsigned value?
255 (11111111). Any result > 255 causes overflow in 8-bit.
Q5 · Why doesn't the denary shortcut earn full marks?
The question requires binary addition to be demonstrated. Denary arithmetic doesn't show the required method (carries in binary columns).
Q6 · Add 00001111 + 00000001. Result and overflow status?
00010000. No overflow — 15 + 1 = 16, which fits in 8 bits.
🚀 Ready for Activities
If you can answer 5 of the 6 knowledge checks above, you're ready to move on. Tap 🎓 Learn for the interactive Addition Drill, then 🎮 Activities to practise.
The 5 rules

The 5 binary addition rules

Binary addition works just like denary addition — but the column overflows at 2 instead of 10.

0 + 0 = 0
No carry
0 + 1 = 1
No carry
1 + 0 = 1
No carry
1 + 1 = 10
Write 0, carry 1
1 + 1 + 1 = 11
Write 1, carry 1

🧱 The stacking rule

Think of each column as a stack. When the stack reaches 2, it collapses — write 0 in this column and carry 1 to the next. When the stack reaches 3, write 1 and carry 1.

Worked example

Signature interactive · watch the carries

Add 10011011 + 00010011. Right to left with all carries visible.

Carries: 1 1 1 1 1 0 0 1 1 0 1 1 + 0 0 0 1 0 0 1 1 ───────────────── = 1 0 1 0 1 1 1 0

Right to left: 1+1=10 (write 0, carry 1) → 1+1+1=11 (write 1, carry 1) → 0+0+1=1 → 1+1=10 (write 0, carry 1) → 1+0+1=10 (write 0, carry 1) → 0+0+1=1 → 0+0=0 → 1+0=1. Result: 10101110 (174 in denary).

Inline trap · You MUST show binary working

Converting to denary, adding, then converting back does not earn method marks. Cambridge want binary addition demonstrated with carries visible.

Cited: 2023 examiner report — verbatim
Overflow

What overflow is, and when it happens

💥

Definition

Overflow occurs when the result of a binary addition is too large to be represented in the number of bits available.

For 8-bit: overflow happens when the result is greater than 255 — a 9th bit is needed but there's nowhere to store it.

📏

Example

11111111 + 00000001

= 255 + 1 = 256

256 cannot fit in 8 bits → overflow

The 9th bit is lost; the register shows 00000000 (incorrect).

Inline trap · Exact wording for overflow

"Too large to represent in the number of bits available" is the mark-scheme phrasing. Don't just say "the answer is too big" — reference the bits.

Cited: 2025 examiner focus
Cambridge syntax reference

How Cambridge phrase these questions

"Add the following two 8-bit binary numbers using binary addition. Show all your working." — 3 marks. Carries visible, binary method, correct answer.
"Give your answer in binary." — always confirm this — never give denary as the final answer.
"State whether an overflow error occurs. Explain your answer." — 2–3 marks. Yes/no + mark-scheme phrasing.
"Define overflow in binary addition." — 1 mark. Verbatim: "too large to represent in the number of bits available".
"Explain why converting to denary is not acceptable." — 2 marks. Method demonstration required.
"State the maximum denary value that an 8-bit binary can represent." — 1 mark. 255.
Working quick check

One more sanity check

What is the correct definition of overflow?

The answer creates a negative number
The answer is too large to represent in the number of bits available
The answer is the result of a logical shift
The answer is too small to store

Activity 1 — Binary Addition Drill medium

Add the two binary numbers. Type the 8-bit result.

Press New Question to start.

Stretch: can you get 5 in a row without a mistake?

Activity 2 — Overflow Detector medium

Look at the two binary numbers. Will adding them cause overflow in 8 bits?

Press New Question.

Stretch: predict overflow before adding — quick check by comparing to 128 (both > 128 = guaranteed overflow).

Activity 3 — Spot the Mistake medium

Which statement about binary addition is WRONG?

Press New Question.

Stretch: explain out loud why the wrong statement is wrong, using mark-scheme phrasing.

Activity 4 — Rules Recall easy

Type the missing values. Aim for 3 in a row without error.

Press New Question.

Stretch: after 3 correct, write out all 5 rules from memory in the notepad.

Activity 5 — 60-second Sprint exam

Answer as many binary-addition questions as you can in 60 seconds. Warm-up before Practice or Exam.

60Seconds left
0Correct
0Personal best

Press Start Sprint to begin.

Stretch: beat your personal best twice in a session.

Adaptive practice

Weak skills come round twice as often. No question repeats immediately. 20 questions across 8 skills.

All Easy Medium Exam

Press New Question.

Cambridge-style exam questions

12 questions in Cambridge Paper 1 style. Every question cites its source. Write your answer, then click Mark for keyword scoring.

Press New Question to begin.

Quick review quiz

Press New Question.

Exam traps — confirmed by examiners

Every trap below is drawn from a real Cambridge examiner report or a recurring pattern flagged across multiple sessions.

Trap 1 · Converting to denary to add

Does NOT demonstrate binary addition. Cambridge require binary working with visible carries.

Cited: 2023 examiner report — "some candidates converted the values to denary, added the values and converted the answer back to binary. Candidates should note that this is not [the required method]"

Trap 2 · Carries not shown clearly

Method marks lost even when the final answer is right. Write carries explicitly above the appropriate columns.

Cited: 2025 examiner report — "candidates need to make sure they are clearly showing where the carries are located"

Trap 3 · Overflow not identified

If a question asks about overflow, you must explicitly state whether it occurs. Just giving a wrong 8-bit answer without flagging overflow loses the mark.

Cited: 2023 examiner report — "candidates were able to recognise that an overflow error occurs when the value is larger than…"

Trap 4 · Overflow defined too vaguely

Saying "the answer is too big" isn't enough. Mark-scheme: "too large to represent in the number of bits available". Reference the bits.

Cited: 2025 examiner focus

Trap 5 · 1 + 1 written as 2

There is no digit 2 in binary. 1 + 1 = 10 (write 0, carry 1).

Cited: recurring pattern

Trap 6 · 1 + 1 + 1 written as 10 not 11

Two 1s plus a carry-in of 1 = 3 = 11 in binary. Write 1, carry 1. Students often write 10 instead.

Cited: recurring multi-carry mistake

Trap 7 · Answer given in denary

Read the question wording. If it says "give your answer in binary", the final answer must be binary — even if you check with denary.

Cited: 2023–2025 recurring wording trap

Trap 8 · Column alignment errors

Right-align the LSBs. A one-column misalignment cascades through every place value.

Cited: recurring exam-technique flag

Trap 9 · 9th bit silently dropped

When the addition produces a 9th bit, don't just write the last 8 bits. Explicitly identify overflow — that's the mark-scheme point.

Cited: recurring in overflow-explanation questions

Memory triggers

🧠 "2 collapses, 3 carries and keeps 1"

Column sum = 2? Write 0, carry 1. Column sum = 3? Write 1, carry 1. That's the whole system.

🧠 255 is the ceiling

8-bit max = 11111111 = 255. Any result > 255 = overflow. The 9th bit has nowhere to go.

🧠 Right to left, always

Just like denary addition — start at the LSB (rightmost column) and work left, carrying as you go.

🧠 "Show the working, keep the marks"

2- and 3-mark addition questions reward method. Even with an arithmetic slip, visible carries + correct method = partial marks. No working = all or nothing.

🧠 "Bits available" — the magic words

When defining overflow: mark-scheme phrase is "too large to represent in the number of bits available". Say it exactly.

🧠 Binary in, binary out

If the question gives binary and asks for a binary answer, don't touch denary except to sanity-check yourself. Denary in the working = no method marks.

Skill grid — tap any badge to override

Green ≥ 70% · Yellow 30–69% · Grey untried. Tap any cell to manually mark a skill as mastered.

Revision checklist

Ten items. Tap each once you're confident. When all 10 are ticked, 1.2A is mastered.

💔 Mistake Tracker

Learn from mistakes

Every wrong answer is logged. See your weak areas and turn them into vault entries.

Mistake log

📊 Progress

Your 1.2A progress

Track accuracy, streaks, and mastery in one place.

Overall statistics

0%Accuracy
0Answered
0Streak

Performance chart

🔖 Bookmarks

Saved Bookmarks

Quick links to questions and activities you want to revisit.

Your bookmarks

📝 My Notes

Your personal notes

Jot down anything useful during your session — questions, mnemonics, or gaps you want to come back to.

Add a note

Title
Note

Saved notes

🗄️ Knowledge Vault

Exam Knowledge Vault

Store definitions, mark-scheme points, model answers, and common mistakes.

Add exam information

Category
Confidence
Title
Exam information

Vault entries