Hash tables quiz

Five questions on Hash tables. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.

0 of 5 answered

Question 1 of 5

Average lookup time in a well-designed hash table is:

A good hash function should:

For the division method h(k) = k mod m, m is best chosen as:

Java's String.hashCode uses the multiplier:

Among 23 people, the chance that two share a birthday is about: