Question: Consider a hash table of size m = 1000 and a corresponding hash function h(k) = m(kA mod 1) for A = (5 1)/2.

Consider a hash table of size m = 1000 and a corresponding hash function h(k) = ⌊m(kA mod 1)⌋ for A = (√5 – 1)/2. Compute the locations to which the keys 61, 62, 63, 64, and 65 are mapped.

Step by Step Solution

3.30 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Substituting each value in the given hash function and calculatin... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction to Algorithms Questions!