The Computing Progression Pathways suggests that at the white level, on the theme of algorithms, a student should demonstrate that he/she:
- Designs a solution to a problem that depends on solutions to smaller instances of the same problem (recursion). (Algorithmic Thinking) (Decomposition) (Abstraction) (Generalisation)
- Understands that some problems cannot be solved computationally. (Abstraction) (Generalisation)
The following link to cs4fn articles that illustrate Algorithms – White Level.
- It turns out though that some missions really are impossible for computers and even Tom Cruise wouldn’t be able to make a difference even if he was given unlimited time.
It is suggested that:
- Primary teachers focus on the badge statements from the Pink to Purple row.
- Secondary teachers focus on the badge statements from the Purple to Black row.
- The white row overlaps with the KS4 qualification specifications.