Computer Science 226 |
Weekly exercises are due at the beginning of lecture on Wednesdays and will be returned in precepts. The exercises are subject to change until they have a due date.
| EXERCISE | DUE |
|---|---|
| Union find | 2/8 |
| Stacks and queues | 2/15 |
| Analysis of algorithms | 2/22 |
| Sorting | 3/1 |
| Priority queues | 3/8 |
| Hashing | |
| Binary search trees | |
| Balanced trees | |
| Radix sort | 3/29 |
| Tries | 4/5 |
| String searching | 4/12 |
| Data compression | 4/12 |
| Geometric algorithms | 4/19 |
| Geometric search | 4/19 |
| Undirected graphs | 4/26 |
| MST | 4/26 |
| Directed graphs | 4/26 |
| Shortest paths | 5/3 |
| Max flow, min cut | 5/3 |
| Linear programming | 5/10 |
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.
