Question: Consider an 1 1 - entry hash table that uses the hash function, h ( i ) = ( 2 i + 5 ) m

Consider an 11-entry hash table that uses the hash function, h(i)=(2i+5)mod11, to
hash the keys 34,22,2,88,23,72,11,39,20,16, and 5, with this order. Suppose the
collisions are handled by linear probing. What's the index of key 72 in the hash table?
 Consider an 11-entry hash table that uses the hash function, h(i)=(2i+5)mod11,

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Programming Questions!