University of Tartu · Algorithmics

Study and revision notes

Topic-by-topic reading materials that complement the lectures, slides, and recordings. Every published note is available as a web page and as a printable PDF.

15 of 15 topic notes currently built

  1. 01

    Course orientation and algorithmic thinking

    Draft
    Read HTML Download PDF
  2. 02

    Growth functions

    Draft
    Read HTML Download PDF
  3. 03

    Linear structures

    Draft
    Read HTML Download PDF
  4. 04

    Sorting searching and recurrences

    Draft
    Read HTML Download PDF
  5. 05

    Trees

    Draft
    Read HTML Download PDF
  6. 06

    Heaps

    Draft
    Read HTML Download PDF
  7. 07

    Succinct data structures

    Draft
    Read HTML Download PDF
  8. 08

    Hashing and Bloom filters

    Draft
    Read HTML Download PDF
  9. 09

    Graphs and graph algorithms

    Draft
    Read HTML Download PDF
  10. 10

    Heuristic search and metaheuristics

    Draft
    Read HTML Download PDF
  11. 11

    Dynamic programming

    Draft
    Read HTML Download PDF
  12. 12

    Exact pattern matching

    Draft
    Read HTML Download PDF
  13. 13

    Automata and regular expressions

    Draft
    Read HTML Download PDF
  14. 14

    Approximate matching

    Draft
    Read HTML Download PDF
  15. 15

    Full-text indexing

    Draft
    Read HTML Download PDF