Homeworks
Points for the homework tasks can be found here Google sheets. You can find your pseudonym at https://courses.cs.ut.ee/user/my_data
The deadline for all groups is Monday midnight (midnight from Monday to Tuesday)
Homework 1. Introduction (05.09, 23:59)
Homework 2. Growth of functions, recursion, binary search (12.09, 23:59)
Homework 3. Master theorem, recursion, quicksort (19.09, 23:59)
Homework 4. Skip-Lists, BST, Trie (26.09, 23.59)
Homework 5. Treap/Heap, Union-find, Random Projection (03.10, 23.59)
Homework 6. Succinct trees (10.10, 23.59)
Homework 7. Hashing, Bloom Filter (17.10, 23.59)
Homework 8. Graphs (24.10, 23.59)
Homework 9. Search heuristics and TSP optimization (31.10, 23.59)
Homework 10. Dynamic Programming, Time Warping (07.11, 23.59)
First Essay Deadline, No other homework (14.11, 23.59)
Homework 11. Text algorithms, NFA, and projects (21.11 23.59)
Homework 12. Suffix trees / arrays, BWT Transform, Feedback (05.12, 23.59)
Final Essay Deadline (06.12, 23.59)
Exam: (period)
Project submission deadline:
Project presentations (Delta)