Computer Science 226 |
| Exercise | Due |
| Elementary sorts | 9/23 |
| Quicksort, mergesort | 9/30 |
| Priority queues | 10/7 |
| Symbol tables | 10/7 |
| Linear selection | 10/14 |
| Hashing | 10/21 |
| Tries | 10/21 |
| Midterm | |
| Data compression | 11/18 |
| Undirected graphs | 11/25 |
| Union find | 11/25 |
| MST | 12/2 |
| Shortest paths | 12/9 |
| Max flow, min cut | 1/13 |
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 others.
