|
Weekly exercises are due at the beginning of lecture on the date given. This list is tentative and is to be considered subject to change. Once the exercise moves above the "Exercises below have not yet been updated for Spring 2010" part of the table, no significant changes will be made. Errata from the book can be found here.
| EXERCISE | DUE |
|---|---|
| Union find | 2/8 |
| Analysis of algorithms | 2/8 |
| Stacks and queues | 2/15 |
| Elementary sorts | 2/22 |
| Mergesort | 2/22 |
| Quicksort (page updated 2/16) | 2/22 |
| Priority queues | 3/1 |
| Binary search trees (page updated 2/24) | 3/1 |
| Red-black trees | do not hand in |
| Hashing | do not hand in |
| Undirected graphs | 3/22 |
| Directed graphs | 3/29 |
| MST | 3/29 |
| Shortest paths (page updated 3/29) | 4/5 |
| String sort | 4/5 |
| Tries | 4/12 |
| Data compression | 4/12 |
| Substring search | 4/19 |
| Pattern matching | 4/19 |
| Geometric algorithms | 4/26 |
| Geometric search | 4/26 |
| Reduction | do not turn 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).
Also, some of the exam question will be based on the exercises, so it is
to your advantage to complete these in a timely manner.
Lateness policy. Late exercises will not be accepted without a University-sanctioned excuse or approval by a preceptor.
Collaboration policy. You are permitted to work with up to one classmate in the same precept. All group members are responsible for jointly contributing to and understanding all parts of the exercise solutions. Submit one solution for the group, and be sure to include the names of all group members.
