Top 20 Vocabulary Words for Children | Vol 91: Write Algorithms, Loops and Debugging Steps | Suggested ages 9–13. Imagine that a computer gives the right count for four coloured cards, then the wrong count when there are no cards. Did the child make a mistake, or did the instructions contain a bug? These twenty vocabulary words help children write a precise algorithm, trace a loop, check conditions and debug an error with evidence.
Parents need no software, online accounts or special devices for this guide. Use four invented label cards and a pencil. The aim is an English-learning skill that travels across mathematics, coding, daily reasoning and clear explanations. Children learn to name the action, check its meaning and explain why a nearby term would not fit.
Reading route: 1. The counting puzzle · 2. Understand what a procedure actually promises · 3. Words for the task and information · 4. Words for choices and repetition · 5. Words for stored values and stopping · 6. Words for testing and repair · 7. Original story: The Library Label Counter · 8. The Fencing Method and precision boundaries · 9. Twelve worked algorithm activities · 10. Ten wrong rules and accurate repairs · 11. Seven-day family learning journey · 12. FAQs, evidence sources and connected reading
1. The counting puzzle: why a correct answer can hide a wrong rule
Suppose a list contains four labels: Blue, Green, Blue, Yellow. A child correctly says that two are blue. Then ask what another child—or a simple program—would need to do to reach the same answer without already knowing it. The important teaching move is to ask for the process, not simply the number.
A clear procedure can be tested against a second list and repaired when it fails. A vague rule such as ‘count carefully’ cannot easily be traced or debugged. Precise vocabulary gives children a handle on each part of the work: the input, the condition, the update, the loop and the output.
This guide uses ‘Blue’ as a literal label and assumes a specified exact-match rule unless an activity explicitly changes it. Cases such as lower-case ‘blue’ are useful because they force us to state assumptions. A programmer may choose a different matching rule; the crucial lesson is that it should be deliberate.
2. Understand what a procedure actually promises
| Stage | What happens | Best language |
|---|---|---|
| Define | Count labels that match the chosen target | task, algorithm, condition |
| Prepare | Supply the list and set count to zero | input, initialise, variable |
| Repeat | Visit each item and test it | loop, iteration, conditional |
| Record | Increase the counter for each match | branch, update, counter |
| Finish | Stop after the list and report the value | termination, output |
| Check | Compare against examples and correct errors | test case, expected result, bug, debugging, trace |
Notice that the same everyday situation supports many vocabulary words without demanding that all twenty appear in one paragraph. Select the term that answers the question. If the question is ‘What information was given?’, use input. If it is ‘How did the value change?’, use update. If it is ‘Where did the result go wrong?’, use trace and debugging.
The original paper algorithm
- Set count to 0.
- Read the next label, if any.
- If that label matches Blue, add 1 to count.
- Repeat until every label in the finite list has been checked.
- Report count and stop.
For Blue, Green, Blue, Yellow, this procedure yields two. But the same description should also explain the empty list and other new inputs. We are not claiming that all algorithms must count items; this is a small model chosen because each state and decision can be seen on paper.
3. Words for the task and information
The first five words help children distinguish the given information from the ordered actions and the produced answer. An algorithm should be precise enough to follow, and its output should have a defined meaning.
| Word | Child-friendly meaning | Natural phrase | Example |
|---|---|---|---|
| 1. algorithm | A clearly specified, finite procedure for carrying out a task or solving a problem. | follow an algorithm | Our paper algorithm counted how many cards had a blue label. |
| 2. input | Information supplied to an algorithm or process. | read the input | The four labels were the input for our counting task. |
| 3. instruction | One stated action or operation in a procedure. | write an instruction | The first instruction set the count to zero. |
| 4. sequence | The order in which instructions or events are performed. | correct sequence | We put the initialise step before the counting loop. |
| 5. output | The information or result produced by a process. | report the output | The program’s output was the number two. |
Word 1: algorithm
What the word does here: An algorithm must specify decisions and steps precisely enough for the chosen task; a vague intention is not an executable plan. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Explain what to do with a card that has a green label. Ask your child to say a fresh sentence using “follow an algorithm”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 2: input
What the word does here: Inputs are not necessarily numbers; colours, words, pictures and other values can be data. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Replace one blue label with yellow and state what changed. Ask your child to say a fresh sentence using “read the input”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 3: instruction
What the word does here: An instruction should be unambiguous for the task, unlike a broad suggestion such as ‘do it carefully’. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Rewrite ‘count the cards properly’ as a precise step. Ask your child to say a fresh sentence using “write an instruction”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 4: sequence
What the word does here: The same steps in a different order may produce a different result. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Predict what goes wrong if the output is printed before counting. Ask your child to say a fresh sentence using “correct sequence”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 5: output
What the word does here: An output is not identical to the input; a result may summarise or transform what was supplied. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: State the output when no card is blue. Ask your child to say a fresh sentence using “report the output”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Small retrieval check: take away the glossary and describe a different three-card list. Invite two chosen words from the group and ask why another word would be less suitable. A word recognised in a table is not yet a word a child can reliably use without the table.
4. Words for choices and repetition
The second group helps learners talk about a rule that selects actions and repeats work. A true/false test is not the same as the branch that follows it.
| Word | Child-friendly meaning | Natural phrase | Example |
|---|---|---|---|
| 6. condition | A test that can be evaluated as true or false under stated rules. | check a condition | The condition was true when a card label exactly matched ‘blue’. |
| 7. conditional | A structure choosing actions according to a condition. | use a conditional | The conditional added one only when the label was blue. |
| 8. branch | One of the alternative paths that an algorithm may follow. | take a branch | A blue card followed the add-one branch. |
| 9. loop | A structure that repeats a set of instructions. | repeat with a loop | The loop inspected each of the four cards once. |
| 10. iteration | One complete pass through a repeated set of instructions. | fourth iteration | The fourth iteration inspected the yellow card. |
Word 6: condition
What the word does here: A condition is a rule being checked; it is not the action that follows from the result. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: What should happen to the counter if the condition is false? Ask your child to say a fresh sentence using “check a condition”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 7: conditional
What the word does here: An ‘if’ instruction depends on a test; it should not be treated as an unconditional command. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Translate IF label is blue THEN add one into natural English. Ask your child to say a fresh sentence using “use a conditional”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 8: branch
What the word does here: The branch in code is a choice of actions, not a physical tree branch or electrical path. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Describe the path used by a non-blue card. Ask your child to say a fresh sentence using “take a branch”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 9: loop
What the word does here: A loop needs a clear collection or stopping rule; repetition without control may never finish. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Explain how the procedure knows it has seen the last card. Ask your child to say a fresh sentence using “repeat with a loop”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 10: iteration
What the word does here: One iteration is not the entire loop; it refers to one pass. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Identify the card examined during iteration three. Ask your child to say a fresh sentence using “fourth iteration”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Small retrieval check: take away the glossary and describe a different three-card list. Invite two chosen words from the group and ask why another word would be less suitable. A word recognised in a table is not yet a word a child can reliably use without the table.
5. Words for stored values and stopping
The third group describes the internal state of the procedure. The counter must begin with an appropriate value, change for the stated reason, and eventually reach the stopping point.
| Word | Child-friendly meaning | Natural phrase | Example |
|---|---|---|---|
| 11. counter | A value used to keep track of how many events or items meet a rule. | increase the counter | The counter rose from one to two after the third card. |
| 12. variable | A named place for storing a value that may be read or changed. | count variable | The variable named count stored the number of blue labels seen so far. |
| 13. initialise | Give a variable a specified starting value before it is used. | initialise to zero | We initialised count to zero before looking at the first card. |
| 14. update | Change a stored value according to a rule. | update the count | We updated count by adding one when the condition was true. |
| 15. termination | The completion or stopping of a procedure under its stated rule. | reach termination | The loop ended after the fourth card had been checked. |
Word 11: counter
What the word does here: A counter tracks a quantity; its starting value and update rule both affect the result. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: What goes wrong if a zero-based count begins at one? Ask your child to say a fresh sentence using “increase the counter”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 12: variable
What the word does here: The name of a variable and the value inside it are different; count can hold zero, one or two. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Say what count contains after the first two cards. Ask your child to say a fresh sentence using “count variable”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 13: initialise
What the word does here: Initialising after part of the work can erase an accumulated result; order matters. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Place the initialise instruction on a sequence card. Ask your child to say a fresh sentence using “initialise to zero”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 14: update
What the word does here: Updating a counter is not always the same as replacing it with a fixed value. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Compare count = count + 1 with count = 1 in plain language. Ask your child to say a fresh sentence using “update the count”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 15: termination
What the word does here: A repeat-until instruction needs a possible stopping condition; do not assume every loop automatically finishes. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Write the stopping rule for a finite card list. Ask your child to say a fresh sentence using “reach termination”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Small retrieval check: take away the glossary and describe a different three-card list. Invite two chosen words from the group and ask why another word would be less suitable. A word recognised in a table is not yet a word a child can reliably use without the table.
6. Words for testing and repair
The final group provides the language of reliable checking: choose test cases, predict outputs, find the first error and trace the repaired process.
| Word | Child-friendly meaning | Natural phrase | Example |
|---|---|---|---|
| 16. test case | A specific input and expected behaviour used to check a procedure. | try a test case | The all-yellow list was a test case with expected count zero. |
| 17. expected result | The outcome the specification says a correct procedure should produce. | compare with the expected result | We expected two blue cards in the original list. |
| 18. bug | A flaw in instructions, code or design that can cause incorrect behaviour. | find a bug | A starting count of one caused an incorrect total for the list. |
| 19. debugging | Systematically finding, understanding and fixing problems in a process or program. | practise debugging | We debugged the counter by tracing each step on paper. |
| 20. trace | A step-by-step record of how values and decisions change while a procedure runs. | trace the algorithm | Our trace recorded the counter after each card. |
Word 16: test case
What the word does here: One successful example cannot prove correctness across every possible input. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Design a case with exactly one blue card. Ask your child to say a fresh sentence using “try a test case”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 17: expected result
What the word does here: Expected means justified by the rules and known input, not what a child happens to hope will occur. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Calculate the expected result before tracing the steps. Ask your child to say a fresh sentence using “compare with the expected result”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 18: bug
What the word does here: A bug is a problem in the procedure, not a moral judgement about the learner. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Show the first instruction responsible for an output of three. Ask your child to say a fresh sentence using “find a bug”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 19: debugging
What the word does here: Changing many instructions at once can hide which change fixed a problem. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Repair the smallest faulty instruction and run the same tests again. Ask your child to say a fresh sentence using “practise debugging”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Word 20: trace
What the word does here: A trace tells us how a particular run behaved; it does not, by itself, prove the algorithm works for all inputs. Use the term only when the child can point to the relevant step, value, choice or evidence in the current task. Avoid forcing technical vocabulary into a sentence where an ordinary accurate verb would be clearer.
Independent practice: Make a table of card, condition result and new count. Ask your child to say a fresh sentence using “trace the algorithm”. Hide the model example and make one change to the card list. If their answer is accurate but too long, keep only the smallest complete statement and build from there.
Small retrieval check: take away the glossary and describe a different three-card list. Invite two chosen words from the group and ask why another word would be less suitable. A word recognised in a table is not yet a word a child can reliably use without the table.
7. Original story: The Library Label Counter
This is a fictional teaching story. Card colours and classroom events are invented, and no real personal or library records are involved.
At a fictional school library, four children needed a quick count of blue spine labels before arranging a display. Their teacher supplied four imaginary cards: Blue, Green, Blue and Yellow. Nobody was using student records, personal details or a real database; the labels were merely a paper exercise.
Amira said, ‘The output is two.’ Her friend Faris agreed but asked a more interesting question: ‘How could a procedure produce that answer every time it sees the same list?’ Together they wrote an algorithm instead of pointing at the two blue cards.
First they initialised a variable named count to zero. They then placed the first card on a trace sheet and checked the condition ‘Is this label Blue?’ The first condition was true, so they updated count from zero to one. They called that the first iteration.
The second card was Green. The condition was false. They did not add one. The third card was Blue, so count changed from one to two. The fourth was Yellow, so the value stayed two. The loop ended after the fourth card and reported an output of two.
Their first trace had neat writing but the teacher gave them another set of instructions: ‘Begin count at one.’ Running the same input now produced three. Faris had found a bug. It did not live in a coloured card. It lived in the initial value.
Amira proposed a fix: initialise to zero. But the teacher asked whether the repair worked only for this one list. The group tested four yellow cards, expecting zero. They tested one blue card, expecting one. They tested two blue cards separated by a green card, expecting two. The repaired algorithm matched all three selected tests.
Then a new question arrived. What happens if there are no cards at all? They realised their loop could simply perform zero iterations and print the initial count of zero. That was an edge case: unusual perhaps, but fully reasonable for a counting task.
A different student wrote, ‘Continue checking cards forever.’ Faris explained why this did not describe their task. Termination mattered: a finite list would finish after the last item. Repetition without a clear stopping rule could be unsuitable.
In the final display, Amira included the word trace beside a small table. Visitors could see not only the answer but how each decision and update led there. The class learned a lesson about both programming and English: an accurate explanation lets another person reproduce the reasoning.
Trace the four-card example
| After | Current card | Does it match Blue? | count |
|---|---|---|---|
| Initialise | No card yet | Not tested | 0 |
| Iteration 1 | Blue | Yes | 1 |
| Iteration 2 | Green | No | 1 |
| Iteration 3 | Blue | Yes | 2 |
| Iteration 4 | Yellow | No | 2 |
| Finish | No items left | Loop terminates | Output = 2 |
Ask the learner to retell the story using four sentences: the task, the original algorithm, the bug and the evidence for the fix. A good retelling includes why starting at one was wrong rather than announcing that the child ‘got it wrong’. We want reasoning that can be explained and repeated.
8. The Fencing Method: precise language, one layer at a time
- Fence 1 — Stable core: The counter is zero.
- Fence 2 — Add timing: We initialise the counter to zero before reading any cards.
- Fence 3 — Add rule: The conditional updates the counter only when the current label matches Blue.
- Fence 4 — Add evidence: With two Blue cards in the four-card input, the trace ends with count = 2.
- Fence 5 — Transfer: With no Blue cards in a new input, no update occurs and the correct output is zero.
This progression is deliberately restrained. If a child claims that a loop ‘always adds one’, return to the conditional. A longer sentence cannot compensate for a missing rule. Fencing means preserving the true core as details, reasons and new contexts are added.
| Nearby terms | Different meanings | Quick check |
|---|---|---|
| Input / output | Input is supplied; output is produced. | Which one was the list, and which was the count? |
| Condition / conditional | The condition is a test; the conditional is a selection structure. | What is checked, and what action follows? |
| Loop / iteration | A loop repeats; an iteration is one pass. | How many cards were examined by iteration two? |
| Variable / value | A variable is a named storage place; its value changes. | Is count the name or the number inside it? |
| Bug / debugging | A bug is a flaw; debugging is the process of finding and correcting it. | Which step was wrong, and how was it repaired? |
| Test / proof | Tests check chosen cases; they do not certify every possible input. | What new case might still reveal a problem? |
A two-sentence transfer answer
Hide the table and introduce an imaginary list of Red, Blue, Blue. Ask the child to write, ‘The input contains three cards, two of which match Blue. After three iterations the counter is two.’ Then change Blue to Red and invite a new explanation without copying. This is useful English: each word contributes to information the reader can check.
9. Twelve worked algorithm activities
Activity 1: List Blue, Green, Blue, Yellow: what should the output be?
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: Start at zero, inspect every card, add one for the first and third cards, and report two. Why it matters: Counting one example correctly is the first test, not proof that every possible list works. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 2: List Yellow, Yellow, Yellow: what should the output be?
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: The condition is false at every iteration, so the count remains zero. Why it matters: Test cases should include values that do not trigger the true branch. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 3: The list is empty: should the loop run once?
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: No. For an ordinary for-each list loop, there are zero iterations and output remains the initial zero. Why it matters: Zero-item cases reveal whether the algorithm depends on an unjustified first item. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 4: The initialise instruction is placed inside the loop.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: That would reset count for every card. Move initialise to before the loop. Why it matters: Stored progress must survive between iterations. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 5: The conditional is changed to ‘If the label is not Blue, add one’.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: That counts non-blue cards; it solves a different problem. Why it matters: A procedure may run perfectly while answering the wrong question. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 6: The program outputs count after the second card.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: It reports an incomplete partial count, not the total for all four cards. Why it matters: Output timing is part of the required sequence. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 7: The third card is Blue, but count is assigned 1 instead of adding 1.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: This replacement may discard prior counts. Use count = count + 1. Why it matters: A variable update should express the intended relationship. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 8: The list contains Blue, blue and BLUE.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: Define the matching rule first. Exact case-sensitive matching counts differently from a case-insensitive rule. Why it matters: An unstated input convention can make answers appear inconsistent. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 9: A friend says a loop is the same thing as one iteration.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: Explain that a loop performs repeated work, while an iteration is one pass. Why it matters: Distinguish the structure from one traversal of it. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 10: A trace shows the count goes 0, 1, 1, 2, 2.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: Explain that the row values record the initial count and the value after each of four cards. Why it matters: Every entry has a position and represents a state. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 11: One test case passes, so the code must be correct forever.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: Give a counterexample or edge case such as zero items, mixed case or one non-blue card. Why it matters: Testing gathers evidence, not a universal mathematical proof. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
Activity 12: A bug appears after the fourth iteration.
Parent prompt: Before showing a solution, ask your child to state the input, the relevant condition, the predicted output and which step should be checked first. Let them draw one row in a trace table. The exercise does not require typing code or memorising symbols.
Model answer: Identify the first incorrect value, then inspect the preceding condition and update. Why it matters: Debugging works best when the cause is localised before more changes are made. After the correction, make one small change to the input and ask for a fresh answer. A single successful copy is not the same as independent reasoning.
10. Ten wrong rules and accurate repairs
Repair 1
Unsteady: “An algorithm is just any vague idea.”
Repaired: An algorithm specifies steps and conditions clearly enough to carry out a stated task. Reason: A goal and a reproducible procedure are different. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 2
Unsteady: “Inputs are always numbers.”
Repaired: Inputs can be labels, words or other suitably represented information. Reason: The library example uses colours as data. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 3
Unsteady: “All statements run in any order.”
Repaired: Sequence can affect output, so instructions must be ordered appropriately. Reason: Initialisation must precede counting. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 4
Unsteady: “IF statements always add one.”
Repaired: A conditional performs an action only when its test and branch require it. Reason: False conditions may follow a different path. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 5
Unsteady: “A loop and an iteration mean the same thing.”
Repaired: A loop is the repeated structure; an iteration is one pass. Reason: Name the whole versus its repeated part. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 6
Unsteady: “Changing count to one adds one every time.”
Repaired: Assigning count = 1 replaces the value; count = count + 1 increments it. Reason: Different update operations can look superficially similar. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 7
Unsteady: “A bug means the child is bad at computing.”
Repaired: A bug is a defect in a procedure to investigate and repair. Reason: Feedback is about the process, not a person. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 8
Unsteady: “Debugging means guessing many fixes at once.”
Repaired: Debug by tracing the first incorrect step, changing one cause and retesting. Reason: Controlled changes reveal causes better. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 9
Unsteady: “One successful test proves universal correctness.”
Repaired: A finite set of tests offers useful evidence, but may miss other inputs. Reason: Check edge cases and stated requirements. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
Repair 10
Unsteady: “A repeat procedure needs no stopping rule.”
Repaired: A correct finite-task procedure requires a defined completion condition. Reason: Termination is part of the design, not an afterthought. Ask the child to point to the affected instruction or trace row. A repair should be specific enough that someone else could change the procedure and rerun a test.
11. Seven-day family learning journey
Day 1
Day 1: Draw four coloured cards and identify algorithm, input, instruction, sequence and output. Ask the child to explain each in one natural sentence, then close the glossary. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Day 2
Day 2: Introduce condition, conditional and branch using the true/false question ‘Is the card Blue?’ Ask which action follows each outcome. Keep the rules explicit. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Day 3
Day 3: Use loop and iteration to trace four cards. Pause after the second card and ask how many iterations have occurred and how many remain. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Day 4
Day 4: Practise counter, variable, initialise and update. Compare the incorrect assignment count = 1 with the intended increment count = count + 1. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Day 5
Day 5: Add termination and test case. Make three lists: none blue, one blue and several blue. Record the expected result before following the procedure. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Day 6
Day 6: Use bug, debugging and trace to repair a deliberately flawed counting algorithm. Change one instruction and describe why it addresses the first incorrect state. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Day 7
Day 7: Transfer to a new task: count fictional cards marked with a star. Without reading the original model, write a five-step algorithm, trace it and explain one edge case. Aim for a short first attempt, one precise correction if needed and a fresh example without a model. If the child is tired, revisit one successful word instead of adding five more.
Ten everyday conversations to rehearse clear reasoning
Dialogue 1 — Adult: “What is our algorithm meant to count?” Child: “Only cards whose label is Blue.” Parent follow-up: Keep the task definition visible.
Dialogue 2 — Adult: “Why do we set count to zero?” Child: “We have not checked any cards yet.” Parent follow-up: Connect a value to the actual state.
Dialogue 3 — Adult: “What is the input?” Child: “Four colour labels on our cards.” Parent follow-up: A label is data even though it is not a number.
Dialogue 4 — Adult: “When do we use the true branch?” Child: “When the current card matches Blue under our rule.” Parent follow-up: Distinguish checking from acting.
Dialogue 5 — Adult: “Is a loop one pass?” Child: “No, one pass is an iteration.” Parent follow-up: Ask the child to point to the repeated instruction.
Dialogue 6 — Adult: “Does Green update the counter?” Child: “No, not in this blue-card algorithm.” Parent follow-up: Different requirements would change the test.
Dialogue 7 — Adult: “If the list is empty, what happens?” Child: “The count stays zero and the loop has no iterations.” Parent follow-up: An edge case can still have a correct answer.
Dialogue 8 — Adult: “Why is beginning count at one a bug?” Child: “It adds one item before we find any matching item.” Parent follow-up: Diagnose the earliest wrong state.
Dialogue 9 — Adult: “Did fixing one test prove everything?” Child: “No, we need to check other cases too.” Parent follow-up: Encourage evidence without overclaiming.
Dialogue 10 — Adult: “What does the trace show?” Child: “The counter after each card is checked.” Parent follow-up: Turn the word into a visible record.
A progress record that measures use, not recital
Choose three target terms, perhaps algorithm, conditional and debugging. Record whether the child recognises, can use with a prompt, uses alone in the original task or transfers to a new counting rule. Save one short independent explanation. If the learner gives the right answer without showing the steps, ask for a trace before increasing difficulty.
Praise the behaviour that matters: explaining an assumption, checking an expected result, locating a first wrong step, and fixing one instruction without blaming a person. This makes computing language useful beyond computing. The same habits help when interpreting instructions in a recipe, checking mathematics homework or organising a group activity.
12. Parent FAQs, sources and connected reading
FAQ 1. Must children learn a programming language before these words?
No. The examples are unplugged algorithms using paper cards. Once the child can trace a procedure in ordinary English, a coding environment can provide another application. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 2. What is the difference between algorithm and program?
An algorithm is a procedure or strategy for accomplishing a task. A program is an implementation expressed for execution in a computing environment, with language and system details. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 3. Is a loop always faster than writing repeated instructions?
A loop often makes a recurring pattern clearer and easier to change, but speed depends on implementation and context. The initial educational benefit is expressing repetition precisely. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 4. What if the child gets the right output with the wrong steps?
Ask for a trace. A correct result may happen by accident for one test case. The trace makes reasoning visible, so you can identify whether the procedure works as intended. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 5. Why start a counter at zero?
When counting matching items, none has been seen before the first card. A zero initial value correctly represents that state; alternative tasks may require different initial values. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 6. What if upper-case and lower-case labels differ?
Define whether the condition is case-sensitive before testing. Both rules can be implemented; the error is leaving the rule unspecified and then changing expectations. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 7. How should parents respond to a programming bug?
Ask the child to identify the first disagreement between expected and actual states. Correct one step, rerun the same test and then add another case. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
FAQ 8. How can I tell that vocabulary has transferred?
Show a fresh problem such as counting green leaves on imaginary cards. Hide the words and ask for an input, condition, counter update, termination rule, trace and expected output. Choose a quick example that demonstrates the distinction instead of demanding an abstract definition first.
External learning references
Code.org: Debugging with Laurel describes student work on correcting algorithms with loops. Code.org: Programming with Angry Birds offers age-appropriate sequencing and debugging ideas. Use these as optional enrichment; every task in this article works offline.
The connected vocabulary series
Vol 90: Circuits, Switches and Conductors · Vocabulary OS Series Index · The Fencing Method for Vocabulary · More vocabulary for children.
Parent takeaway: the best algorithm explanation tells another reader what the input is, what decision is tested, which value changes, when repetition stops and why the output is justified. One repaired bug and one successful transfer to an unfamiliar list show more learning than copying twenty terms.