593 views
0 0 votes

In this question :

 

https://gateoverflow.in/2272/gate1997-12

Had it been "Open addressing" only then for part A would it be :

$\frac{n-1}{n}*\frac{n-2}{n-1}*.....*\frac{n-k-1}{n-k}$

?

(as every time we occupy a bucket , the probability will be changed as all slots are equiprobable.)

?

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
391
391 views
HeadShot asked Nov 11, 2018
391 views
In this question : https://gateoverflow.in/2272/gate1997-12Had it been "Open addressing" only then for part A would it be :$\frac{n-1}{n}*\frac{n-2}{n-1}*.....*\frac{n-k-...
1 1 vote
0 0 answers
393
393 views
Nisarga k asked Mar 2, 2025
393 views
Consider a hash table with 365 slots (same as the number of days in a year). Assuming uniform hashing, what is the maximum number of keys (n) that can be inserted before ...
0 0 votes
2 2 answers
1.2k
1.2k views
0 0 votes
0 0 answers
583
583 views
Aravind Adithya 1 asked Jan 14, 2019
583 views
Consider hash function H(k)=(3*i+5)mod11.Chaining is used to handle collisions.The sequence is 12,44,13,88,23,94,11,39,20,16,5.If 2 more insertions are made what is proba...