Homeworks
Points for the homeworks will be here.
Homework 1. Introduction (10.09, 23:59)
Homework 2. Sorting algorithms (17.09, 23:59)
Homework 3. Binary search and Master theorem (24.09, 23:59)
Homework 4. Skip-Lists, Trees (01.10, 23:59)
Homework 5. Heap, Union-find (08.10, 23:59)
Homework 6. Succinct trees (15.10, 23:59)
Homework 7. Hashing, Dynamic programming (22.10, 23:59)
Homework 8. Time warping, Hashing, Graphs (29.10, 23:59)
Homework 9. Graphs, choosing essays (05.11, 23:59)
Homework 10. Graphs II (12.11, 23:59)
Essay. first submission (19.11, 23:59) (no HW session in week 19.-23.11)
Homework 11. Search Heuristics, Optimization (26.11, 23:59)
No lectures during week Nov 26-30, i.e. Tue 27th and Thu 29th.
Essay. Essay feedbacks submission (two essays) (03.12, 23:59) (no HW session in week 03.12.-7.12)
Homework 12. (10.12, 23:59) (last HW sessions during week 10.-14.12)
Essay. Final Essay submission taking into account feedback received (17.12, 23:59)
Projects. Project Poster PDF submission (20.01, 23:59) (they need to be also printed!)