in Algorithms
970 views
1 vote
1 vote
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?
in Algorithms
by
970 views

2 Comments

for successful search $\frac{2}{10}$

unsuccessful search $\frac{8}{10}$
0
0
unsuccessful searches = 5

successful searches = 2 (approx)
1
1

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