0. I can explain what is meant by the term abstraction.
1. I can explain why abstraction is helpful when designing a solution to a problem.
2. I can explain what decomposition is and how it is useful.
3. I can explain what is meant by algorithmic thinking.
4. I can identify the inputs, processes and outputs of a problem.
5. I can use structure diagrams to help design a solution to a problem.
6. I can identify common errors.
7. I can explain what trace tables are and how to use them.
8. I can explain how a binary search work
9. I can explain how a linear search works.
10. I can explain how a bubble sort works.
11. I can explain how a merge sort works.
12. I can explain how an insertion sort works.
13. I can explain how to produce pseudocode to describe an algorithm and why it is needed.
14. I can explain how to produce a flowchart to describe an algorithm.
15. I can interpret, correct, refine and complete a range of algorithms using algorithms, flowcharts and the OCR reference language
Please log in to save your self-assessments.