Lectures

9.2.2011 : Oragnisational and admin information
- Slides:(pdf) (6up pdf)
9.2.2011 : Introduction
- Slides:(pdf) (6up pdf)
10.2.2011 : Order of Growth and basics of analysis
- Slides:(pdf) (6up pdf)
No lecture on Wednesday, 16th. Practical sessions and lecture on Thursday will be done.
17.2.2011, 23.2. , 2.3 : Linear structures, sorting
- Slides:(pdf) (6up pdf)
- Lecture notes on skip lists from the MIT
9.3, 10.3, 16.3, 17.3 : Trees, heaps, k-d trees, augmented data structures
- Slides:(pdf) (6up pdf) (updated: all slides)
23.03 : Heaps
- Slides:(pdf) (6up pdf)
- Kamp: You're doing it all wrong. (pdf)
24.03 : Hashing
- Slides:(pdf) (6up pdf)
29.03, 30.03, 5.04, 6.04 : Graphs
- Slides: Set 1 (pdf) (6up pdf)
- Slides: Set 2 (pdf) (6up pdf)
13.04 : Modern Graph Algorithms (Konstantin Tretyakov)
- Slides: (pdf)
14.04 : Randomized Algorithms (Konstantin Tretyakov)
- Slides: (pdf)
20.04 : Dynamic Programming
- Slides: (pdf) (6up pdf)
- Web sites with generalised edit distance examples (English, Russian, Old Estonian, etc searches) generalised edit distance pronunciation
21.04, 27.04, 28.04 : Search heuristics
- Slides: (pdf) (6up pdf)
04.05, 05.05 : Clustering and Seriation
- Slides: (pdf) (6up pdf)
11,12.05 : Computer Graphics algorithms - by Egon Elbre
- Slides: (Lecture 1) (Lecture 2)
18.05 : Parallel algorithms
- Slides: (PDF) (6 up)

-- THE END --