CS 330 Algorithms

Homework 5


some questions require pretty much one-liner answers (e.g., from 13.1, even with explanations) - keep this in mind!
also, most problems in the book offer interesting examples and you should at least try to read these problems (e.g. in chapter 13); same goes for the extra-credit problems in the end.

Hashing +


Search Trees:

Red-black trees:

Augmenting Search Trees: Dynamic Order statistics

Extra credits:



Here is my exchange with a student, which I think might be useful to others (the bottom paragraph is the most important):