Register

Hashing Doubt
closed

• closed by
180 views
0 votes
0 votes
closed with the note: Duplicate

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.)

 

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
HeadShot asked Nov 11, 2018
312 views
Hashing Doubt
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.) ?
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-...
User Avatar
0 votes
0 votes
1 answer
2
tishhaagrawal asked Dec 16, 2023
312 views
Made Easy Test Series : Consider an open addressing hashing scheme with m slots and n keys. Assuming uniform hashing, the expected number of empty slots in the hash table for m=7 and n=3 is equal to ____________(Round off to two decimal places)
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
User Avatar
Link Copied!