Work through the list without notes. If you cannot do a statement, follow its link, then come back. Guide = study guide; Practice = practice questions.
Understanding
- I can name the three building blocks of an algorithm and say what each one does. (Guide: “What is an algorithm made of?”; Practice question 1)
- I can explain the difference between selection and repetition. (Guide: “Selection: one decision, one path” and “Repetition: do it again until it is done”; Practice question 2)
- I can explain why order and nesting of the blocks change the result of an algorithm. (Guide: “Order matters”; Worked example 2; Practice question 4)
- I can say what a stopping condition is and why a repetition needs one. (Guide: “Repetition: do it again until it is done”; Practice question 8)
Skills
- I can describe an everyday process as numbered steps in plain language. (Guide: “Writing an algorithm down”; Worked example 1; Practice question 7)
- I can read a flowchart and say which shapes are sequencing, selection and repetition. (Guide: Figure 1; Practice questions 2 and 8)
- I can trace a short algorithm with a table and give its output. (Guide: “Tracing an algorithm”; Practice questions 3 and 5)
- I can pick the correct description of an algorithm from several that differ only in order or nesting. (Practice question 6)
Reasoning
- I can compare two algorithms that use the same blocks and explain why they give different results. (Guide: Worked example 2; Practice question 9)
- I can spot a statement that is in the wrong place relative to a loop and say how to fix it. (Practice question 10)
- I can check an algorithm’s result against a quick estimate (such as an upper bound or a cap). (Guide: Worked example 1)
All ticked? Move on to the Topic 2.2 study guide, Boolean Expressions.