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 (06.09, 23:59)
Homework 2. Growth of functions, recursion, binary search (13.09, 23:59)
Homework 3. Master theorem, recursion, quicksort (20.09, 23:59)
Homework 4. Skip-Lists, BST, Trie (27th of September, 23.59)
Homework 5. Heaps (4th of Oct, 23.59)
Homework 6. K-d tree, RPTree, Treap, Union-Find (11th of Oct, 23.59)
Homework 7. Hashing, Bloom Filter, Succinct Trees (18th of Oct, 23.59)
Homework 8. Graphs (25th of Oct, 23.59)
Homework 9. Search heuristics and TSP optimization (November 1, 23.59)
First Essay Deadline, No other homework (08.11, 23.59)
Homework 10. Dynamic Programming, Time Warping (15th of Nov, 23.59)
Homework 11. Text algorithms, NFA, and projects (22.11 23.59)
Homework 12. Suffix trees / arrays, BWT Transform, Feedback (December 6, 23.59)
Final Essay Deadline (07.12, 23.59)