Lectures

Links below are to the handout versions of the lecture slides. The recordings can be accessed via Blackboard or Echo360.

Note: Lecture titles/topics are subject to change. Note: Lecture links to pdfs will be added at least one day prior to the lecture.

1. L01_Introduction
2. L02_BasicUnionFind
3. L03_ImprovingUnionFind
4. L04_Induction1
5. L05_Induction2
6. L06_AnalysingRecursiveAlgorithms
7. L07_Mergesort
8. L08_Mergesort2StacksQsHeaps
9. L09_Heaps
10. L10_MapsSetsTrees
11. L11_Graphs
12. L12_GraphPaths
13. L13_TwoProofs
14. L14_MinimumSpanningTree
15. L15_BST
16. L16_BalancingBSTs
17. L17_Hashing1
18. L18_HashingProbing
19. L19_HashingApplications
20. L20_GreedyAlgorithms
21. L21_DynamicProgramming1
22. L22_DynamicProgramming2
23. L23_DynamicProgramming3
24. L24_PandNP
25. [L25_Capstone] No new notes. Finished off L24.
26. L26_Wrapup