edited by
409 views

1 Answer

Best answer
1 votes
1 votes

What i thought was that, after mapping these elements using chaining, there are 5 slots left.

So any element that comes afterwards will want to be mapped to any of the 11 slots but it has only 5 available. Probability of all the 11 slts are the same since mod function is uniformally distributed. 
So the required probability will be 5/11=0.45



what M.E. says: any element will map to 1 of the 5 slots so it will be 1/5=0.2

 

edited by

Related questions

1 votes
1 votes
2 answers
1
Amit puri asked Aug 24, 2016
396 views
A hash table of length 100 uses chaining. WHat is the probability that all the values are hashed inti the same slot after 5 intersections?5/100$^5$1/100$^4$1/100$^5$None ...
0 votes
0 votes
1 answer
2
Himanshu1 asked Dec 16, 2015
779 views