Lectures

  • Lecture 1 - Course organisation
  • Lecture 1 (8.2) - Introduction
  • Lecture 2 (15.2) - Order of Growth, O notation
  • Lecture 3 (16.2, 22.2, 29.2) - Linear structures, sorting, skip lists
  • Lecture 4 (29.2, 7.3,14.3) - Trees
  • Lecture 5 (15.3) - Heaps
  • Lecture 6 (21.3) - Hashing
  • Lecture 7 (22.3) - Dynamic Programming
  • Lecture 8 (27.3,28.3,4.4.,5.4,18.04) - Graph agorithms
  • Lecture 8 (19.04, ... ) - Search and metaheuristics
  • Lecture 9 (25.04) - Randomized algorithms
    (Konstantin Tretyakov)
  • Lecture 10 (26.04) - Compression
    (Konstantin Tretyakov)
  • Lecture 11 (09.05, 16.05 ) - Clustering and Seriation
  • Lecture 12 (17.05) - Parallel Algorithms

*

*

Sidebar
Page edit