Computer Science 226
Algorithms and Data Structures
Spring 2004


Course Information | Assignments | Exercises | Lectures

EXERCISES

Exercise Due
Union find 2/9
Elementary sorts 2/9
Quicksort, mergesort 2/16
Priority queues 2/23
Hashing 2/23
Binary search trees 3/1
Balanced trees 3/1
Tries 3/8
Radix sort 3/8
Midterm 3/10
String searching 3/22
Data compression 3/29
Geometric algorithms 3/29
Geometric search 4/5
Undirected graphs 4/5
MST 4/12
Directed graphs 4/12
Shortest paths 4/19
Max flow, min cut 4/19
Pattern matching 4/26
Linear programming 4/26



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.