Lectures (~ 24 lectures a' 1h30m)
- Lecture 0 -- Demo Demo slides - Powerpoint
- Lecture 1 (11.02) - Introduction (pdf) (2 up) (6 up)
- Lecture 2 (12.02) - Growth Functions (pdf) (2 up) (6 up)
- Lecture 3 (18.02, 19.02) - List structures (pdf) (2 up) (6 up)
- Lecture 4 (25.02, 26.02, 4.03) - Tree structures (pdf) (2 up) (6 up)
- Lecture 5 (5.03) - Sorting revisited (pdf) (2 up) (6 up)
- Lecture 6 (5.03,11.03) - Hashing (pdf) (2 up) (6 up)
- Lecture 7 (11.03,12.03,18.03,19.03,25.03) - Graph algorithms (pdf) (2 up) (6 up)
- Lecture 8 (25.03,26.03) - Advanced Heaps (pdf) (2 up) (6 up)
- Lecture 9 (26.03, 01.04) - Dynamic Programming (pdf) (2 up) (6 up)
- Lecture 10 (02.04, 08.04) - Regular expressions and finite automata (pdf) (2 up) (6 up)
- Lecture 11 (09.04) - Clustering (pdf) (2 up) (6 up)
- Lecture 12 (15.04, 29.04 ) - Search & heuristics (pdf) (2 up) (6 up)
- Lecture 13 (30.04, 13.05) - Parallel algorithms (pdf) (2 up) (6 up)
- Lecture 14 (13.05) - Final remarks, maths (pdf) (2 up) (6 up)
- Final meetings, wrap-up (27.05,28.05) - Project presentations(?), consultations, etc
Exams.
Recommended topics elsewhere:
- Asymptotic notations (MIT)
- Recurrences - the Master Method [ PDF ]
- Competitive analysis; Self-organising lists ; Move to Front [ PDF ]
- NP completeness & Reductions [ Greedy & Intro to NP ] [ II ] [ III ] [ IV ]