Computer Science 226
Data Structures and Algorithms
Spring 2002


Course Information | Announcements | Assignments | Exercises | Lectures | Errata

EXERCISES

Some of the problems call for you to write small programs or run experiments. Do not submit your programs or provide excessive detail about the experiments.


Exercise Due
Union find 2/11
Elementary sorts 2/11
Quicksort, mergesort 2/18
Priority queues 2/25
Radix sort 2/25
Symbol tables 3/4
Hashing 3/11
Tries 3/11
Midterm  
Strings, pattern matching 4/1
Data compression 4/1
Geometric algorithms 4/8
Undirected graphs 4/15
MST 4/15
Directed graphs 4/22
Shortest paths 4/22
Max flow, min cut 4/29
Minimum cost flow 4/29
Linear programming 5/6



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.







cos226 Home Page
rs@cs.princeton.edu
Last modified: January 25, 2002