Question: At what position will the key 6 0 be stored in the hash table using h ( k ) above if quadratic probing is used

At what position will the key 60 be stored in the hash table using h(k) above if quadratic probing is used to resolve collisions, where c1=1, and c2=2?
(i)5
(ii)6
(iii)15
(iv)12
At what position will the key 60 be stored in the above hash table if double hashing is used to resolve collisions, assuming h1(k)=h(k) and h2(k)=2+(kmod11)?
(i)0
(ii)6
(iii)11
(iv)12
How many collisions occurred for inserting 60 in the given hash table in the previous question?
(i)1
(ii)2
(iii)3
(iv)4
What is the load factor of the given hash table before inserting 60?
(i),1217
(ii)617
(iii),917
(iv),179
 At what position will the key 60 be stored in the

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 Databases Questions!