Algorithmics homeworks 2012
Deadline for submissions is before the start of your group's practical session. In the session, you should be able to present any of the tasks marked as completed.
1. 15-16.02 HW 1 - Introduction
2. 22.02 HW 2 - Big Oh and Linear structures
3. 29.02,1.03 HW 3 - Sorting ...
4. 7-8.03 HW 4 - Trees
5. 14-15.03 HW 5 - Trees (2)
6. 21.-22.03 HW 6 - Trees (3), Heaps
7. 28.-29.03 HW 7 - Hashing, Dynamic programming
8. 4.-5.04 HW 8 - Graph Algorithms I
9. 11.-12.04 HW 9 - Graph Algorithms II
10. 25.-26.04 HW 10 - Graph Algorithms III
11. 2.-3.05 HW 11 - Randomized algorithms & Compression
May 9,10 - no homework. Please prepare for projects and heuristic search practice during May 16-17
12. 16.-17.05 HW 12 - Search heuristics (notice - 2 weeks!)