Tick each line when you can do it without looking at the guide. Each line names where it is taught and tested. Revisit the study guide for anything you cannot yet do.
Understanding
- ☐ I can describe the four-part recipe: initialise, traverse, update, use (study guide: Algorithms are patterns, not tricks).
- ☐ I can explain why a maximum starts from the first element (study guide: Maximum and average; practice: Question 1).
- ☐ I can explain why an average needs a cast and a guard for an empty list (study guide: Maximum and average; practice: Question 2).
- ☐ I can explain why a reversal visits only half of the list (study guide: Worked example 2; practice: Question 4).
Skills
- ☐ I can write maximum, minimum, sum, average and count methods (study guide: Maximum and average; Worked example 1).
- ☐ I can write at-least-one and all tests with early returns (study guide: Count, any and all).
- ☐ I can write consecutive-pair and duplicate algorithms with correct loop bounds (study guide: Consecutive pairs and duplicates; practice: Questions 3, 6 and 9).
- ☐ I can write reverse, rotate and insert-in-order algorithms (study guide: Worked example 2; practice: Questions 5, 7 and 10).
Reasoning
- ☐ I can trace an algorithm on a given list and state the result (practice: Questions 3, 5 and 8).
- ☐ I can find the bug in a faulty algorithm (practice: Questions 1, 2 and 4).
- ☐ I can explain why the order of conditions in a while test protects against out-of-range access (practice: Question 10).
- ☐ I can traverse two collections with one index and bound the loop correctly (study guide: Deleting and traversing two collections; practice: Question 8).