CS 229r: Algorithms for Big Data
[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 will
have an associated 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 must be via email to
cs229rf13assignments@seas.harvard.edu and include a
compiled PDF attachment. The file name should follow the
pattern: [firstinitial][lastname]ps[number].pdf; for example, a
solution to the 3rd assignment from John Doe should be named
jdoeps3.pdf.
 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 11am 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 Tuesday, Sept. 10:
[PDF][TeX]

Due Tuesday, Sept. 17
[PDF][TeX]

Due Thursday, Sept. 26
[PDF][TeX]

Due Tuesday, Oct. 8
[PDF][TeX]

Due Thursday, Oct. 17
[PDF][TeX]

Due Tuesday, Oct. 29
[PDF][TeX]

Due Tuesday, Nov. 5
[PDF][TeX]

Due Tuesday, Nov. 12
[PDF][TeX]

Due Tuesday, Nov. 19
[PDF][TeX][FIG]