Sequencing, decisions and repetition
Key knowledgeUnderstand how ordered operations, branches and loops control technological algorithms and simulations.
Build the idea
An implemented algorithm relies on correctly ordered instructions, decisions and repetition. Initialisation establishes a valid starting state; branches choose the next action; a stopping rule connects the process to an accuracy target. Trace several steps before trusting a full run, and record a limit or error condition so a failed calculation does not silently continue.
Try the sample task
Implement the following Newton iteration outline for f(x)=x³−7 and explain the purpose of its initialisation, decision and repetition: Set x=2 and a maximum of 20 iterations. At each step, compute d=3x²; if d=0, stop with a different-start warning. Set next=x−(x³−7)/d. Record next and its residual. Stop when both |next−x|<10(−8) and |next³−7|<10(−8); otherwise replace x by next and repeat.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
Focused, tool-neutral workflow. Expected results are mathematically derived; students must run the procedure and record their own outputs. Other technology functions and contexts remain part of the broader outcome.