Computer Science 423
Theory of Algorithms
Spring 2008
ASSIGNMENTS

Help on Problem Sets: clarity and conciseness of your exposition. On problem sets allowing collaboration, you may discuss the problems with others and consult reference materials. However, your solution write-ups should be entirely your own, and you should carefully cite outside sources of ideas, whether they are friends, research papers, or books. To learn the most, you should first try each problem entirely on your own, without outside help. On problem sets not allowing collaboration, all your ideas and all your work should be your own.

Late Problem Sets: Problem Sets will be due on Wednesday at the beginning of class. You may turn them in the following Monday for half credit. Any late submissions will receive no credit, unless there are serious extenuating circumstances.


DUE DATE ASSIGNMENT Notes
2/13 Problem Set 0
2/27 Problem Set 1
Problem Set 1, Question 3 correction
.
3/12 Problem Set 2
4/2 Problem Set 3 Clarification problem 3 on problem set 3: The restrictions in part (a) are a little vague. During the scan, the algorithm is allowed to examine any previously scanned neighboring pixel, as well as any auxiliary information associated with these pixels. If this information includes pointers to other parts of some data sturcture, these pointers can be followed as well. The extra space you use should be measured in words, each of which is capable of storing a signed integer between -NM and +NM. Please let me know if you need any additional clarification.
4/7 Problem Set 4 .
5/9 Problem Set 5 .
5/19 Final Take Home Exercise