Weekly exercises are due at the end of lecture on the date given. The exercises are subject to change until they have a due date.
|1. Stacks and queues||2/14|
|2. Union find||2/14|
|3. Analysis of algorithms||2/21|
|5. Priority queues||2/28|
|6. Binary search trees||3/7|
|7. Balanced trees||3/7|
|8. Hashing||do not hand in|
|9. Radix sort||3/28|
|11. String searching||4/4|
|12. Data compression||4/11|
|13. Geometric algorithms||4/18|
|14. Geometric search||4/18|
|15. Undirected graphs||4/25|
|17. Directed graphs||5/2|
|18. Shortest paths||5/2|
|19. Linear programming||do not hand in|
|20. Reduction||do not hand in|
Grading policy. Grades on the problem set questions will be: 4 (correct), 3 (minor mistake), 2 (major mistake), 1 (poor try) or 0 (all wrong or not submitted).
Lateness policy. Late problem sets will not be accepted without a University sanctioned excuse or prior approval by a preceptor.
Collaboration policy. Problem sets should reflect your own work, but you are permitted to work with up to three classmates. If you do so, include the names of all of your collaborators with your solutions.