6.897: Advanced Data Structures (Spring'05)

Prof. Erik Demaine TA: Mihai Patrascu

There will be a weekly assignment containing a single problem, up to 9 assignments in total.
Problems are usually posted on this web page on Tuesdays and due the next Monday, late at night.
Solutions will also be posted here after the due date; for this reason, late days are not allowed.
You may skip any one problem, or we will ignore the problem with the lowest grade. If you volunteered to scribe twice, we will ignore the lowest two grades.
The answers must be typeset in LaTeX. The answers must fit in one page, or your solution will not be read. Use at least 10 pt font and 1 inch margins. This rule is meant to prepare you for writing research publications: one often has to explain great ideas in a very limited number of pages.
Submissions must be via email to 6897-ps#at#theory.csail.mit.edu and include a compiled PDF attachment. The file name should follow the pattern: [initial][last-name]-ps[number].pdf; for example, a solution to the 3rd problem set from John Doe should be named jdoe-ps3.pdf.
Solutions do not need to include all calculations, trivial details etc. Just prove to us that you found the solution, and you understand it well.
Problems will be graded on a 0-2 scale.
- 0 = You didn't get it. Filling one page to the brim does not mean you can't get zero. Please don't write stuff you know is wrong.
- 1 = Your solution was ultimately a good one, but the write-up contained significant errors or omissions.
- 2 = (We think) you got it.