CS 224: Advanced Algorithms
Prof. Jelani Nelson TFs: Zhixian Lei, Tom Morgan
[Home] [Lectures]
[Assignments] [Project]
Policies
 No late days. No extensions.
 Each student will have their lowest problem set score dropped.
 Each problem set contributes the same amount to your final grade (other than the one that's dropped).
 The answers must be typeset in LaTeX; here is a template to start with.
 Each problem set problem will
have an associated (possibly fractional) page limit which submissions must fit into. Anything beyond the page limit will not be read. Use at least
10 pt font and 1 inch margins.
 Submissions are via Canvas, one PDF per pset problem.
 Solutions do not need to include all calculations, trivial details etc.
Just prove to us that you found the solution, and that you
understand it well.
 Homework is always due at 11:59pm on the due date.
 Collaboration to solve homework problems is
allowed, but students must then write up the solutions on their
own and list names of all collaborators at the beginning of the first page.
 You may read papers to help find
solutions to problems, but they must be properly
cited, and you must explain the solution in a way that
demonstrates your understanding (a homework submission simply
stating "this problem is solved in paper X" would receive no credit,
for example). Bibliographies do not count toward page limits.
Assignments

Due Monday, Feb. 6:
[PDF][TeX]

Due Wednesday, Feb. 15:
[PDF][TeX]

Due Monday, Feb. 27:
[PDF][TeX]

Due Wednesday, Mar. 8:
[PDF][TeX]

Due Monday, Mar. 27:
[PDF][TeX]

Due Wednesday, Apr. 5:
[PDF][TeX]

Due Monday, Apr. 17:
[PDF][TeX]