Policies
- There will be a weekly one-page assignment, up to 9 assignments in total.
- 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.
- 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.
Assignments
Solutions are courtesy of the course TA, Aleksandar Zlateski, and are used with permission.
Assignment files.
| ASSN # |
TOPICS |
ASSIGNMENTS |
SOLUTIONS |
| 1 |
Transposing a matrix, logarithmic redux |
(PDF) |
(PDF) |
| 2 |
Query time kd-trees, segment stabbing |
(PDF) |
(PDF) |
| 3 |
Ray shooting in simple polygons |
(PDF) |
(PDF) |
| 4 |
Analysis partition trees, speed up with LCP array |
(PDF) |
(PDF) |
| 5 |
Cartesian trees in linear time, space requirements for integer data structures |
(PDF) |
(PDF) |
| 6 |
Dynamizing static search structures |
(PDF) |
(PDF) |
| 7 |
Finding the most significant 1 bit |
(PDF) |
(PDF) |
| 8 |
Cuckoo hashing, conditional expectations |
(PDF) |
(PDF) |
| 9 |
Link-cut tree analysis, dynamic partition of [n] into intervals |
(PDF) |
(PDF) |
