961 views
1 votes
1 votes
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?

1 Answer

0 votes
0 votes
10/8 ln 5 and 5 for successful and unsuccessful search respectively.

If X is load factor.

Successful search = $(1/X) log (1/(1-x))$

Unsuccessful search = $1/(1-x)$

Related questions

0 votes
0 votes
0 answers
1
Rahul_Rathod_ asked Dec 28, 2018
413 views
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
1 votes
1 votes
0 answers
2
hrcule asked Aug 9, 2018
501 views
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...
16 votes
16 votes
2 answers
3
3 votes
3 votes
1 answer
4