This week, the homework is on paper - no computer is needed. You can get it in class on Wednesday or print this PDF file. It's 19 pages long and covers 3 weeks of lectures, so don't leave it till the last minute.
While it's mostly drill-and-practice, the subject matter includes the hardest data structures in the course.
The assignment should get you comfortable with various kinds of sorted dictionaries, as well as sorting algorithms. We will actually need sorted dictionaries in the next assignment, but we'll rely on Java's TreeMap implementation (a red-black tree) so that you don't have to write the code yourself. Nonetheless, the present assignment should leave you in a state where you could write the code.
Jason Eisner - jason@cs.jhu.edu - $Date: 2004/04/05 09:33:27 $