Week 1
Lecture 1 - Static and Dynamic Linear Data Structures

Week 2
Tutorial 2 - Stacks
Lecture 2 - Static and Dynamic Linear Data Structures (Cont.)

Week 3
Tutorial 3 - Exercises with Stacks - Infix & Postfix
Lecture 3 - Non-Recursive Sorting Algorithms

Week 4
Tutorial 4 - Exercises with Non-Recursive Sorts
Lecture 4 - Recursive Sorting Algorithms

Week 5
Tutorial 5 - Exercises with Recursive Sorts

Week 6
Tutorial 6 - Further Exercises With Sorts
Lecture 5 - Searching Algorithms

Week 7
Tutorial 7 - Exercises with Searches
Lecture 6 - Hashing

Week 8
Tutorial 8 - Exercises in Hashing
Lecture 7 - Trees

Week 9
Tutorial 9 - Exercises with Binary Trees
Lecture 8 - Tree Traversal & AVL Self Balancing Trees

Week 10
Tutorial 10 – Further Exercises with Binary Trees
Lecture 9 - Splay Trees & B-Trees

Week 11
Tutorial 11 – Exercises with AVL and Splay Trees
Lecture 10 - Heaps (Priority Queues)

Week 12
Tutorial 12 - Exercises with Heaps
Lecture 11 - Graphs

Week 13
Tutorial 13 - Doing it by hand
Lecture 12 - Graphs (Cont.) and Optimisation

Week 14
Tutorial 14 - We answer Your Questions
Lecture 13 - Revision