COMP4500 - Advanced Algorithms and Data Structures
- Lecture 1 - Algorithm Analysis
- Lecture 2 - Asymptotic Notation
- Lecture 3 - Divide and Conquer Algos
- Lecture 4 - Solving Recurrences
- Lecture 5 - Graphs
- Lecture 6 - Graph Data Structures
- Lecture 7 - Minimum Spanning Trees
- Lecture 8 - Minimum Spanning Trees Algos
- Lecture 9 - Shortest Path Algorithms
- Lecture 10 - Kruskal’s MST Algorithm
- Lecture 11 - Dynamic Programming Pt 1
- Lecture 12 - Dynamic Programming Pt 2
- Lecture 13 - Dynamic Programming Pt 3
- Lecture 14 - Greedy Algorithms
- Lecture 15 - Amortised Analysis
- Lecture 16 - Computational Complexity I
- Lecture 17 - Computational Complexity II
- Lecture 18 & 19 - Probabilistic Analysis and Randomised Algorithms