Study Guide Instructor view
Binary Addition and Overflow
Teaching notes for Lesson 1.3, with controls for presenting it.
Keep this page on your own screen. Share only the lesson window. The lesson window holds no teaching notes, so sharing it cannot show them.
Presenting
- Open the lesson in its own window and share that window, not this one.
- Use Next and Previous here, or the lesson’s own, to move through the lesson. Next reveals one thing at a time: the next idea, or the answer to the question on screen, then the next step. Previous takes the last reveal back. The line below says what is on screen and what Next will show.
- Reveal hints and answers when the class is ready, and reset a demonstration before using it again.
The controls need JavaScript and a browser that supports BroadcastChannel. Without them, open the lesson in presentation mode and use its own controls.
The two windows talk to each other only inside this browser, on this device. Nothing is sent to a server, and no account is needed. A second device (a phone or another tablet) cannot follow the lesson window yet.
Now on the lesson window
- On screen
- Next teaching point
Guidance for this point
Lesson plan
- Level
- Intermediate
- Time
- About 60 minutes; the steps below add up to 60
Learners start from the column addition they already know (58 + 67), discover that binary uses exactly the same carrying with only 0 and 1, and then meet overflow through a three-wheel counter that runs out of room before they see it in an 8-bit register. The lesson ends with explaining overflow in their own words and applying it to a coin counter and a turnstile, so the teacher can see whether learners compare the true result with 255 and not just look at the leftmost bit.
Objectives
- Add two positive 8-bit binary integers, column by column, using carries
- Check a binary addition by converting the numbers and the answer to denary
- Explain what overflow is and recognise when an 8-bit addition causes it
- Explain why overflow happens, in terms of the size of the register
- Work out the value an 8-bit register holds after an overflow
Before the lesson
- Mini whiteboards or paper for column working: carries need to be written above the columns.
- Optional: a toy odometer, or a picture of a three-wheel mileage counter, for the counter step.
- Have the column total table (0, 1, 2, 3 with write and carry) ready to show only after learners have tried 1 + 1 and 1 + 1 + 1 themselves.
- Decide whether learners will convert answers to denary by hand or with a calculator for the checks; hand conversion is better practice but slower.
Steps
Introduction Opening
On the lesson window now
On screen: the lesson’s title, module and number; Next adds its objectives and key terms, as the lesson page lists them; Next again begins the first step.
Objectives on screen
- Add two positive 8-bit binary integers, column by column, using carries
- Check a binary addition by converting the numbers and the answer to denary
- Explain what overflow is and recognise when an 8-bit addition causes it
- Explain why overflow happens, in terms of the size of the register
- Work out the value an 8-bit register holds after an overflow
Purpose: Learners start from the column addition they already know (58 + 67), discover that binary uses exactly the same carrying with only 0 and 1, and then meet overflow through a three-wheel counter that runs out of room before they see it in an 8-bit register. The lesson ends with explaining overflow in their own words and applying it to a coin counter and a turnstile, so the teacher can see whether learners compare the true result with 255 and not just look at the leftmost bit.
1. Adding on paper Think 6 min
On the lesson window now
Purpose: Recall the carrying rule in denary, so that binary addition later is the same idea with a smaller set of digits.
Ask
- Add 58 and 67 in columns. What do you do in the ones column?
- What do you do with the 1 you carry?
Responses to expect
- 8 + 7 is 15, write 5, carry 1
- The carried 1 is added into the tens column, which then gives 12 and another carry
- The answer is 125
Misconceptions to challenge
- A learner may believe: “The carry is thrown away once the units digit is written.” Respond: Ask where the other 10 has gone. The carried 1 is worth ten ones and must be added into the tens column.
On the board or with the pen
- Write 58 + 67 in columns and draw the carries above the next column with the pen, so the same layout is reused in binary.
Checking understanding: Mini whiteboards: every learner writes the answer and shows where each carry went.
Depending on the answers
- If most learners add without a carry error: move on after one minute; the point is the vocabulary of write and carry.
- If several learners lose the second carry (into the hundreds): redo the tens column slowly: 5 + 6 + 1 = 12, write 2, carry 1.
English as an additional language
- Check the verbs carry and column; show a carry with an arrow on the board.
In the lesson window
- Think it through: Add 58 and 67 in columns, starting from the right. What do you do when the ones column adds up to more than 9, and what do you do in the tens column afterwards?
2. One column in binary Discover 8 min
On the lesson window now
Purpose: Learners work out for themselves what a binary column does with 1 + 1, then with 1 + 1 + 1, before the table of column totals is shown.
Ask
- What do you write for 1 + 1 in one binary column, if the digit 2 does not exist?
- A column has two 1s and a carry in. What does it write and what does it carry?
Responses to expect
- Two is 10 in binary, so write 0 and carry 1
- The total is 3, which is 11: write 1 and carry 1
Misconceptions to challenge
- A learner may believe: “1 + 1 + 1 is written as 11 in the column, with nothing carried.” Respond: 11 is right as the total, but a column holds one digit. Ask which part of 11 moves to the next column.
- A learner may believe: “The carry coming in can be ignored, so 1 + 1 gives write 0 and carry 1 again.” Respond: Ask learners to count how many 1s are in the column altogether, including the carry.
On the board or with the pen
- Draw the four-row table (total 0, 1, 2, 3) only after the question, and fill it in with learners rather than showing it complete.
What learners should notice
- The right-hand digit of the column total is written and the left-hand digit is carried.
Checking understanding: The column-total-three check: option A (write 0, carry 1) shows who forgot the carry in; option C shows who confuses total and digit.
Depending on the answers
- If learners choose ‘write 0 and carry 1’: ask them to count the 1s in the column, carry included, then convert that total to binary.
- If nearly all are correct: ask them to state the rule in one sentence: write the right-hand digit and carry the left-hand digit.
English as an additional language
- Say the totals aloud as ‘one plus one plus one is three; three is one-one in binary’.
Discussion pause: Give thirty seconds of silent thinking on 1 + 1 before anyone speaks.
In the lesson window
- Think it through: In one binary column, what would you write for 1 + 1, given that the digit 2 does not exist? What would you do with the rest?
- Check your understanding: In one column the two bits are 1 and 1, and a carry of 1 comes in from the right. What does the column write, and what does it carry?
3. Adding two 8-bit numbers Explain 12 min
On the lesson window now
Purpose: Apply the column rule across eight columns, with a worked example that gives the reason for each step, and then a trace table where learners complete the later rows.
Ask
- Add 00000101 and 00000011 column by column. Which column do you start with, and why?
- In the finished table, in what order do you read the Write column to get the answer?
Responses to expect
- Start at the right, because carries move left
- Read from the 128s at the bottom up to the 1s at the top: 10100001, which is 161
- The check in denary: 107 + 54 = 161
Misconceptions to challenge
- A learner may believe: “Read the Write column from the top down (10000101).” Respond: Ask which column is worth 128 and where that bit belongs in the answer. The top row is the 1s column, the right-hand end.
- A learner may believe: “The last column carried a 1, so a ninth bit is needed (read-the-trace option C).” Respond: Look at the carry out of the 128s column: that column totalled only 1, so nothing was carried past it.
- A learner may believe: “Carries can be added in at any time.” Respond: A carry must go into the very next column to the left, before that column is totalled.
On the board or with the pen
- Rebuild the first rows of the trace table on the board, then ask learners to say the totals before writing them.
- Write the denary check beside the working: 45 + 27 = 72.
What learners should notice
- Every carry out of a column becomes the carry in of the next column to its left.
Checking understanding: The read-the-trace check shows who understands the direction in which the answer is read.
Depending on the answers
- If many learners have errors in the 8s to 64s rows: model one row aloud: ‘bit of A plus bit of B plus carry in is the total; write the right-hand digit’.
- If the class is fluent: skip the first rows and move to the checking question.
Support
- Give learners the column values 128 to 1 printed above the eight columns.
- Let learners use a ruler under the column they are adding.
English as an additional language
- Check the table headings Carry in, Write and Carry out before starting the trace.
In the lesson window
- Think it through: Add 00000101 and 00000011 column by column, starting from the right. Then check your answer by converting all three numbers to denary.
- Check your understanding: Which statement about the finished table is correct?
4. Adding on your own Experiment 8 min
On the lesson window now
Purpose: Independent practice: add pairs of bytes without the trace table, and check by sight which of three answers is the right sum.
Ask
- Add 0011 1111 and 0000 0001. Where does the carry go?
- How can you check your answer in denary?
Responses to expect
- The carry travels through six columns: 63 + 1 = 64, which is 0100 0000
- Convert both numbers and the answer to denary
Misconceptions to challenge
- A learner may believe: “A column with no 1 in either number cannot be affected by a carry.” Respond: Show the 0011 1111 + 1 sum: the carry ripples through columns whose own bits are 1, then into the 0 column.
- A learner may believe: “The sum 0110 0011 + 0010 0101 can be found by adding each column alone (answer 0100 0110).” Respond: Ask what 1 + 1 gives in the right-hand column and where that carry goes.
Checking understanding: Check sum-ninety-nine-plus-thirty-seven, then ask for the denary conversion of the correct option.
Depending on the answers
- If learners get the right answer but cannot say why the other two are wrong: ask which carry each wrong option forgot.
Stretch
- Add three bytes by adding the first two and then the third.
- Make up a pair of bytes whose sum has a carry in every column.
In the lesson window
- Check your understanding: Which of these is 0110 0011 + 0010 0101?
5. A counter that runs out Think 5 min
On the lesson window now
Purpose: Meet the idea of overflow in familiar terms: a counter with too few wheels shows a wrong answer without any warning.
Ask
- The counter shows 998 and the car drives 5 miles. What does it show?
- Is it the right distance? What went wrong?
Responses to expect
- 003
- No: the true answer is 1003, which has four digits, and the counter has three wheels
- The leading 1 has nowhere to go
Misconceptions to challenge
- A learner may believe: “The counter would stop at 999 when it is full.” Respond: Real counters roll round to 000. Ask how the toy car’s counter would behave.
- A learner may believe: “The counter shows an error message.” Respond: This counter has no way to warn anyone: it just shows 003.
On the board or with the pen
- Draw three boxes for the wheels and write 998; add 5 and show where the extra 1 would sit.
Checking understanding: A show of fingers: how many digits does the true answer need, and how many does the counter have?
English as an additional language
- Check wheel, mileage and counter; draw a picture of an old-fashioned car dial.
Discussion pause: Ask learners to predict silently before revealing.
In the lesson window
- Think it through: What does the counter show after the 5 miles? Is it showing the right distance, and what has gone wrong?
6. Overflow in an 8-bit register Explain 9 min
On the lesson window now
Purpose: Define a register and overflow, and show where a lost carry goes with the worked example 200 + 100.
Ask
- How many bits does an 8-bit register have, and what is the largest value it can hold?
- Which of the three additions causes overflow: 128 + 129, 200 + 55 or 100 + 100?
Responses to expect
- Eight bits hold 0 to 255
- 128 + 129 = 257, which is greater than 255
- 200 + 55 = 255 fits exactly; 100 + 100 = 200 fits
Misconceptions to challenge
- A learner may believe: “A 1 in the leftmost bit means overflow.” Respond: 1100 1000 starts with 1 and is a good 200. Overflow means the true result is greater than 255.
- A learner may believe: “200 + 55 overflows because it reaches the largest value.” Respond: 255 is the largest value the register can hold, so 255 fits. Overflow needs a result of 256 or more.
- A learner may believe: “Overflow happens because the two numbers are large (100 + 100).” Respond: Ask for the answer first: it is the result, not the starting numbers, that must be compared with 255.
On the board or with the pen
- Draw the register as eight boxes, with a dotted ninth box labelled 256s, crossed out.
- Write 300 − 256 = 44 beside the 200 + 100 working.
What learners should notice
- The lost carry is worth 256, so the stored value is the true answer minus 256.
Checking understanding: The which-sum-overflows check: the three options diagnose the largest-value, large-numbers and exact-fit confusions.
Depending on the answers
- If learners choose 200 + 55: ask them for the largest pattern, 1111 1111, and its value; then add 1 to it.
- If learners are confident: ask what the register holds after 128 + 129 (answer 1).
Support
- Provide a card with 1111 1111 = 255 for reference.
English as an additional language
- Define register as ‘a small store with a fixed number of boxes for bits’.
In the lesson window
- Check your understanding: Which of these additions causes overflow in an 8-bit register?
7. Use it somewhere new Apply 9 min
On the lesson window now
Purpose: Apply overflow in new contexts, correct a plausible piece of reasoning, and complete a table of what an 8-bit register holds.
Ask
- Priya says an answer starting with 1 has overflowed. What is wrong with that?
- A game register holds 250 coins and gains 10. What does it hold?
Responses to expect
- 100 + 100 = 200, which fits in eight bits
- 250 + 10 = 260, which is 256 more than 4, so the register holds 4
Misconceptions to challenge
- A learner may believe: “The register stops at 255 when full (coin-counter option B).” Respond: An ordinary register does not stop: the carry out of the leftmost column is lost, and the bits that remain are 0000 0100.
- A learner may believe: “A full register resets to 0 (coin-counter option C).” Respond: It reaches 0 only if the total is exactly 256. Work out 260 − 256.
- A learner may believe: “Priya is right: a leading 1 always means overflow.” Respond: Convert 1100 1000 to denary and compare with 255.
Checking understanding: The coin-counter question has four options that each represent a different wrong model of what a full register does.
Depending on the answers
- If learners fail the overflow table on 182 + 74: show that the result is exactly 256, so all eight bits are 0 and the carry is lost.
- If learners complete the table quickly: ask what 255 + 1 gives and why a turnstile would show 0.
Support
- Allow learners to find the true total in denary first, then subtract 256 if needed.
Stretch
- Find two bytes whose sum overflows so that the register holds 100 (for example 200 and 156).
In the lesson window
- Apply it: Priya adds 0110 0100 and 0110 0100 in an 8-bit register and gets 1100 1000. She says: “The answer starts with a 1, so it has overflowed.” What is wrong with her reasoning?
- Apply it: What does the register hold afterwards, assuming the game does nothing to handle overflow?
8. Bring it together Consolidate 3 min
On the lesson window now
Purpose: Learners explain overflow with their own example and apply it to a turnstile, before the summary is shown.
Ask
- Explain to a friend what overflow is and why it happens, with an example of your own.
- The turnstile register holds 1111 1111 and a visitor comes in. What does it hold?
Responses to expect
- A fixed number of bits, so only 0 to 255; a ninth bit is needed and the carry is lost
- 0000 0000, and the count appears to restart
Misconceptions to challenge
- A learner may believe: “The register would hold 1 0000 0000 (256).” Respond: That needs nine bits. Ask how many bits the register has room for.
Checking understanding: Collect two or three of the learners’ own examples and check each against the rule: result greater than 255.
Depending on the answers
- If learners cannot explain without looking back: start the next lesson with the three-wheel counter and ask them to link it to the 8-bit register.
In the lesson window
- Think it through: Without looking back, explain to a friend what overflow is and why it happens in an 8-bit register, using an example of your own.
- Check your understanding: A fictional museum’s turnstile counts visitors in an 8-bit register that holds 1111 1111. Another visitor comes in and 1 is added. What happens?
Lesson recap Closing
On the lesson window now
On screen: the lesson’s objectives again; Next adds the closing question, which asks the class to explain each one in their own words without looking back. It says nothing about what anyone has learnt: use the answers to decide what to revisit.
Points to listen for
- Add binary numbers from the right, one column at a time: a column total of 0 or 1 is written as it is, 2 writes 0 and carries 1, 3 writes 1 and carries 1.
- Check an addition by converting both numbers and the answer to denary.
- An 8-bit register holds 0 to 255. Overflow happens when the true result is greater than 255: the carry out of the leftmost column is lost.
- A leading 1 does not mean overflow. Compare the true result with 255.
Consolidation
- Add binary numbers from the right, one column at a time: a column total of 0 or 1 is written as it is, 2 writes 0 and carries 1, 3 writes 1 and carries 1.
- Check an addition by converting both numbers and the answer to denary.
- An 8-bit register holds 0 to 255. Overflow happens when the true result is greater than 255: the carry out of the leftmost column is lost.
- A leading 1 does not mean overflow. Compare the true result with 255.