|
Weekly exercises are due at the beginning of lecture on the date given. The exercises are subject to change until they have a due date.
| # | EXERCISE | DUE |
|---|---|---|
| 1 | Union find | 9/16 |
| 2 | Analysis of algorithms | 9/23 |
| 3 | Stacks and queues | 9/23 |
| 4 | Sorting 1 | 9/30 |
| 5 | Sorting 2 | 10/7 |
| 6 | Priority queues | 10/7 |
| 7 | Binary search trees | 10/21 |
| 8 | Hashing | 10/21 |
| 9 | Undirected graphs | 11/4 |
| 10 | Directed graphs | 11/11 |
| 11 | MST | 11/11 |
| 12 | Shortest paths | 11/18 |
| 13 | Radix sort | 11/18 |
| 14 | Tries | 11/25 |
| 15 | Data compression | 11/25 |
| 16 | Pattern matching | 12/2 |
| 17 | Geometric algorithms | 12/9 |
| 18 | Geometric search | 12/9 |
| Not yet updated for Fall 2008 | ||
| 19 | 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 two other classmates in your 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.
