To provide a uniform theoretical treatment of the data structures and algorithms used in systems and applications programming. This module includes a practical component to reinforce learning and to encourage students in the practical use of theoretical material. Syllabus: - Mathematics Review; - Review of the ADTs, internals and usage of simple data structures and associated algorithms, in particular recursive algorithms; - Linked Lists and Networks; - Recursion, and the elimination of recursion from algorithms; - Study of sorting algorithms: quicksort, heapsort, mergesort and bucket and radix sorting; - Analysis of general divide-and-conquer algorithms; - Searching: tree searching, AVL trees, splay trees; - Graph algorithms: graph traversal and spanning forests, depth and breadth first search of graphs; connectivity; minimal spanning trees for weighted graphs; shortest path algorithms; networks.