Computer Science 226
Algorithms and Data Structures
Fall 2005

Course Information | Assignments | Exercises | Lectures


Weekly exercises are due at the beginning of lecture on Thursdays and will be returned in precepts. The exercises are subject to change until they have a due date.

Union find 9/22
Stacks and queues 9/29
Analysis of algorithms 9/29
Sorting 10/6
Priority queues 10/13
Hashing 10/20
Binary search trees 10/25
Balanced trees 10/25
Radix sort 11/10
Tries 11/10
String searching 11/17
Data compression 11/17
Geometric algorithms 12/1
Geometric search 12/1
Undirected graphs 12/1
MST 12/8
Directed graphs 12/8
Shortest paths 12/15
Linear programming 12/15
Regular expressions don't turn in
Reduction don't 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).

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.