Data types and data structures
Covering data types and the algorithms that manipulate them, this topic explores the theory of abstract types as well as the creation of data structures in code. From integers to string manipulations, through arrays and dictionaries to graph traversal, hashing algorithms and minimal spanning trees, a firm grasp of this topic is imperative for both the examined and practical-programming assessed tasks.
Links and Resources
A CS Unplugged series resource aimed at younger students but also works well with A level students. The document contains student activities covering constructing Steiner trees, greedy algorithms and solving traversal problems.
This is a resource from the MIT Open Courseware series that provides a very clear introduction to stacks and queues.
The CS Unplugged series are aimed at younger students however, this activity works well with A level students. It illustrates the concept of minimal spanning trees and graph traversal.