Weekly homeworks
HW1. (10.09,12.09) Introduction, Order of Growth
HW2. (17.09,19.09) Sorting, recurrences, etc.
HW3. (24.09,26.09) Skiplists, trees, etc.
HW4. (1.10,3.10) Trees, binary heaps, ...
HW5. (8.10,10.10) Treaps, Union-Find, Heaps ...
HW6. (15.10,17.10) Succinct trees
HW7. (22.10,24.10) Hashing
HW8. (29.10,31.10) Graphs 1.
HW9. (5.11,7.11) Graphs 2.
HW10. (12.11,14.11) Graphs 3.
HW11. (19.11,21.11) Dynamic programming, heuristics
HW12. (10.12,12.12) Heuristics ... last
Practical sessions
- 70% of practical sessions are obligatory to attend
- Points for homeworks are here
- PDF is the best format for the homeworks, source code might be attached as separate files