Decisions and repeats in algorithms
Follow and describe algorithms that include a sequence of steps, branching (a decision such as 'if it is raining, take an umbrella') and iteration (repeating steps, such as 'hop 3 times')
Lesson
Set out your lesson
“Decisions and repeats in algorithms means practising the idea at the table with a simple screen-free or sandbox check. We will demo once, then your child tries.”
Bring to the table
- Paper command cards (forward, turn, repeat) OR a free visual-blocks editor preview
- Pencil
Extra for the adult
Worked example. Forward, forward, turn right reaches the star. Changing the order fails.
Optional challenge. For Decisions and repeats in algorithms, add one harder example after success.
What to notice. Keep one parent note: examples tried; results; support used. This session samples Decisions and repeats in algorithms, not mastery.
Share and support
Compare teaching approaches
Teaching approaches
Gakuva’s recommended starting approach is selected. You can still compare every option.
1 approach
Decisions and repeats in algorithms means practising the idea at the table with a simple screen-free or sandbox check. We will demo once, then your child tries.
Materials: Paper command cards (forward, turn, repeat) OR a free visual-blocks editor preview; Pencil. 1. Say the goal of Decisions and repeats in algorithms in plain words once. 2. Adult lines up three command cards into a short sequence that reaches a goal. 3. Child builds three short sequences (or edits one) and tests whether the goal is met. 4. Fresh check: one fresh sequence that reaches the goal. Record and stop. Done: three tested sequences with pass/fail noted. Proof: parent note of examples and results. Stop: End after the fresh check; keep optional challenge for another day.
Family records and proof options
Keep a record of your learning
Save photos, notes, and attendance. Export a proof packet for compliance or portfolio reviews.
Practice this concept
Start practiceDecisions and repeats in algorithms practice
Practice key ideas from Decisions and repeats in algorithms.
Free · no login · no ads · Practice answers and completion are not saved. Parent observation remains the lesson record.
Learning resources
Extra practice links — they do not replace Gakuva’s teaching approach.
Code.org · Practice link — not the full lesson
AI+CS education for ages 5 to 11
Before you open · source notes
Free computing activity hub useful for Decisions and repeats in algorithms. An adult picks one activity; not a single graded exam.
Free activity pages, no sign-in required for the tested path.
Before you openAsk the learner what steps they followed and what they would try next.
Opening this link does not save learning or assess mastery.
Source, access and review notes
Public Code.org page. An anonymous GET on 2026-11-12 returned HTTP 200 with no login or payment prompt for this URL. Opening the link does not save practice or assess mastery. An adult should preview and guide the learner.
Code.org. “AI+CS education for ages 5 to 11.” External page; Gakuva does not copy, host, embed, or redistribute materials.
Unknown — link only
Check understanding
- Follow movement instructions that include a repeat (e.g. 'repeat 3 times: step forward, clap') and describe which part was repeated
- Follow an algorithm with a decision (e.g. 'If the card is red, put it in the box; otherwise put it on the table') and explain what the decision did
- Describe the steps, decision and repeat in a familiar routine, such as getting ready for school
“In a game like 'If I clap, jump; if I stomp, sit — repeat 5 times', can your child follow the rules and explain the 'if' part and the 'repeat' part?”
Curriculum record
- Type
- Procedural
- Subject
- Computing
- Domain
- Algorithms & Programming
- Age range
- Ages 6–8
Standards