Register

Made Easy Full Test - Hashing + Probability
closed

• closed by
1,150 views
4 votes
4 votes
closed as a duplicate of: Hashing

Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, at least a chain of size 3 is created? (assume simple uniform hashing is used)

Correct answer - $29*8^{^{-3}}$

My answer - $8*8^{^{-3}}$

• closed by
User Avatar
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
982 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
426 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
515 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
0 votes
0 votes
1 answer
4
Rohan Mundhey asked Nov 9, 2016
692 views
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty?
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining).1)Wh...
User Avatar
Link Copied!