The Computing Progression Pathways suggests that at the black level, on the theme of algorithms, a student should demonstrate that he/she:

• Recognises that the design of an algorithm is distinct from its expression in a programming language (which will depend on the programming constructs available). (Algorithmic Thinking) (Abstraction)
• Evaluates the effectiveness of algorithms and models for similar problems. (Algorithmic Thinking) (Abstraction) (Generalisation)
• Recognises where information can be filtered out in generalizing problem solutions. (Algorithmic Thinking) (Abstraction) (Generalisation)
• Uses logical reasoning to explain how an algorithm works. (Algorithmic Thinking) (Abstraction) (Decomposition)
• Represents algorithms using structured language. (Algorithmic Thinking) (Abstraction) (Decomposition)

The following link to cs4fn articles that illustrate Algorithms – Black Level.

• Looking at a picture from your digital camera or a digital movie, it’s all just 11001100011– hardly inspiring, and I don’t really see what it means!

  Picture This? JPEG It! [cs4fn-pdf]

More of our resources, including linked computing ‘story’ booklets can be found in our resources section. You may also want to look at cs4fn’s teacher resources or browse the latest cs4fn magazine.

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.