Work through the list without notes. If you cannot do a statement, follow the pointer, then come back. Guide = the study guide; Practice = the practice questions.
Understanding
- I can define an algorithm as a finite set of instructions that accomplish a specific task (Guide: What an algorithm is; Practice: Question 1)
- I can list ways to express an algorithm without a programming language (Guide: What an algorithm is; Practice: Question 7)
- I can state that every algorithm can be built from sequencing, selection and iteration (Guide: What an algorithm is)
- I can name the three ways of creating an algorithm (Guide: Three ways to create an algorithm)
- I can give the benefits of reusing existing correct algorithms (Guide: Three ways to create an algorithm; Practice: Question 6)
Skills
- I can use the maximum, minimum, sum, average and divisibility algorithms (Guide: Worked example 2; Practice: Questions 4 and 5)
- I can modify a maximum algorithm to find the minimum (Guide: Worked example 2; Practice: Question 8)
- I can combine two algorithms to build a third (for example the range) (Guide: Worked example 2; Practice: Question 8)
- I can rewrite a conditional as an equivalent Boolean expression (Guide: Worked example 1, Part A; Practice: Questions 2 and 9)
Reasoning
- I can find an input that makes two look-alike algorithms differ (Guide: Worked example 1, Part B; Practice: Questions 3 and 9)
- I can explain why agreeing on a few tests does not prove equivalence (Guide: Comparing algorithms; Common misconceptions)
- I can test ties and boundaries when comparing algorithms (Guide: Worked example 2, Step 5; Practice: Question 9)
When every line is secure, move on. The revision notes are here: revision notes.