HomeAboutLecturesProblem ClassesAssessmentResources

Lectures

1 16/01/18 Introduction  
2 18/01/18 Recursion  
3 23/01/18 Complexity Analysis  
4 25/01/18 Sorting: Heapsort  
5 30/01/18 Sorting: MergeSort  
6 01/02/18 Sorting: QuickSort  
7 06/02/18 Sorting Limits  
8 08/02/18 Stable Sorting  
9 13/02/18 Order Selection  
10 15/02/18 The Graph ADT  
11 21/02/17 Depth-first search  
12 23/02/17 Breadth-first, and Transitive Closure  
13 27/02/18 Directed Acyclic Graphs  
  02/03/18 Lecture cancelled - snow
14 06/03/18 Adaptable Priority Queue  
15 08/03/18 Dijkstra's Algorithm  
16 13/03/18 Prim's Algorithm  
17 15/03/18 Kruskal's Algorithm  
18 20/03/18 All-Pairs Shortest Paths  
19 22/03/18 Stable Matching  
20 10/04/18 Substring searching  
21 12/04/18 Longest Common Subsequence  
22 17/04/18 Revision Notes only - no lecture
23 19/04/18 The sample paper