This part of the module is about data structures and algorithms. Data structures are needed in order to represent information so that algorithms can conveniently manipulate it. The fundamental topics of practical interest concerning algorithms are specification, verification and performance analysis. We'll look at each of these for topics for each problem at hand.
The data structures covered in this module are lists, binary search trees, heap three, priority queues, hash tables and graphs.