Suppose you are building an open address hash table with double hashing. The has

Question

Suppose you are building an open address hash table with double hashing. The hash table capacity is n, so that the valid hash table indexes range from 0 to n. Fill in the blanks: In order to ensure that every array position is examined, the value returned by the second hash function must be ________________________ with respect to n. One way to ensure this good behavior is to make n be _______________, and have the return value of the second hash function range from _________ to _________ (including the end points).

Explanation / Answer

In order to ensure that every array position is examined, the value returned by the second hash function must be greater than the value from the point of collision with respect to n.

One way to ensure this good behavior is to make n be NON ZERO.

and have the return value of the second hash function range from value greater than zero(value greater than point of collision) to n-1.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.