Register

Made easy hashing prob
closed

• closed by
361 views
0 votes
0 votes
closed as a duplicate of: ME Test Series
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 probability that new items are hashed into empty slot.

My ans

5/11*4/11

key

5/11*4/11*2

I cant explain why this extra 2 is needed.Ordering between the keys is already counted.pls help
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
tishhaagrawal asked Dec 16, 2023
361 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
2 votes
2 votes
1 answer
3
Devwritt asked Oct 27, 2016
468 views
Topic-Hashing, Made Easy Test Series problem . Please explain and concept also.
Please explain also--
Please explain also
User Avatar
0 votes
0 votes
0 answers
4
Nandkishor3939 asked Jan 8, 2019
616 views
Random Question on prob
Two cards are drawn from a pack of 52 cards. The probability that they are a king and a queen is? a)16/260 b)26/260 c)16/1326 d)8/1326
Two cards are drawn from a pack of 52 cards. The probability that they are a king and a queen is?a)16/260b)26/260c)16/1326d)8/1326
User Avatar
Link Copied!