Reading material

If you use the first edition of the textbook, follow the reading material in orange. If you use the second edition, follow the reading material in brown.

(1st) pages 290-291 (Section 7.6.3) , also have a look at the material about hash tables in the second edition

(2nd) pages 350-356 (Section 8.3)

Additional material

Pseudocode for linear probing: PostScript and PDF
public static final int CONSTANT = 33;

public int hashCode()
    int nameHashCode = name.hashCode();
    int numberHashCode = (int) number;
    int gpaHashCode = (new Double(gpa)).hashCode();
    return (nameHashCode + CONSTANT * (numberHashCode + CONSTANT * gpaHashCode));


Give an example of the quadratic probing strategy not finding an empty bucket even though there is one. You do not need more than five buckets.