Computer Science 226
Algorithms and Data Structures
Spring 2003


Course Information | Assignments | Exercises | Lectures | Errata

EXERCISES

These exercises are subject to frequent updating during the semester.

Exercise Due
Union find 2/10
Elementary sorts 2/10
Quicksort, mergesort 2/17
Priority queues 2/17
Symbol tables 2/24
Balanced Trees 3/3
Hashing 3/3
Radix sort 3/3
Tries 3/10
String searching 3/10
Midterm 3/12
Pattern matching 3/24
Data compression 3/31
Geometric algorithms 3/31
Geometric search 4/7
Undirected graphs 4/7
MST 4/14
Directed graphs 4/14
Shortest paths 4/21
Max flow, min cut 4/21
Minimum cost flow 4/28
Linear programming 4/28



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