COS 423
Theory of Algorithms
Spring 2013

Course Information   |   Problem Sets   |   Lecture Slides   |   Precepts


Below are links to the problem sets. You will submit the problem sets via our electronic submission system.

1 Wed 2/13 not available not available allowed
2 Wed 2/20 not available not available allowed
3 Wed 2/27 not available not available no collaboration
4 Wed 3/13 not available not available allowed
5 Wed 4/3 not available not available allowed
6 Wed 4/17 not available not available allowed
7 Wed 5/1 not available not available allowed
8 Tue 5/14 not available not available no collaboration

Writing up your solutions.  Learning how to write clear, concise, and rigorous solutions is an important component of this course. Vague and sloppy solutions often turn out to have inaccuracies that render them incorrect. You will lose a significant number of points if your solution is imprecise or lacks sufficient explanation, even if the solution turns out to be correct. Here are a few guidelines:

Submission policy.  You must submit your solutions electronically via the Dropbox submission system. Your solutions should be carefully organized and neatly typeset in LaTeX using the COS 423 LaTeX template (and the pdf output). If you're new to LaTeX, here is a brief LaTeX guide (and the tex source file). Please follow these guidelines:

You will need to type your Princeton netID and password for authentication. You can resubmit and unsubmit files as needed up until the submission deadline. Any files submitted at grading time will be graded as is.

Lateness policy.   Problem sets are due at 11pm on the date specified, with a 3-hour grace period. Late submissions are assessed a penalty of 10% of the total points for that problem set per day or partial day: 0–3 hours late (no penalty), 3–24 hours late (10%), 24–48 hours late (20%), and so forth. Your first 4 late days are automatically waived. No additional lateness days will be waived without the recommendation of a Dean or a letter from McCosh Health Center.

Collaboration policy.   Designing and analyzing an algorithm is an individual creative process much like writing a composition or computer program. You must reach your own understanding of the problem and discover a path to its solution. Each problem set will be designated as either no collaboration or collaboration allowed.

Academic integrity.   The creative process leading to the discovery of a solution is as important as understanding and being able to present a solution. The following activities are explicitly prohibited in all graded coursework:

This policy supplements the University's academic regulations, making explicit what constitutes a violation for this course. Princeton Rights, Rules, Responsibilities handbook asserts:

The only adequate defense for a student accused of an academic violation is that the work in question does not, in fact, constitute a violation. Neither the defense that the student was ignorant of the regulations concerning academic violations nor the defense that the student was under pressure at the time the violation was committed is considered an adequate defense.
If you have any questions about these matters, please consult a course staff member. Violators will be referred to the Committee on Discipline for review; if found guilty, you will receive an F as a course grade plus whatever disciplinary action the Committee imposes.