Register

atleast a chain of 3 in hashing

309 views
1 votes
1 votes
Consider a hash table with 8 slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, atleast a chain of size 3 is created? (assume simple uniform hashing is used)
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
s_dr_13 asked Mar 6, 2019
977 views
Hashing
Consider an open address hash table with uniform hashing. Out of 10 locations, 8 are occupied. What are the expected number of probes in an unsuccessful and successful search respectively?
Consider an open address hash table with uniform hashing. Out of 10 locations, 8 are occupied. What are the expected number of probes in an unsuccessful and successful se...
User Avatar
0 votes
0 votes
0 answers
2
Rahul_Rathod_ asked Dec 28, 2018
425 views
hashing
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
User Avatar
1 votes
1 votes
0 answers
3
hrcule asked Aug 9, 2018
513 views
Hashing
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is used.
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is us...
User Avatar
3 votes
3 votes
1 answer
4
Rahul Jain25 asked Oct 8, 2016
798 views
Hashing+Probaility
User Avatar
Link Copied!