retagged by
3,150 views
3 votes
3 votes

Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is _______ (upto 2 decimal place).

retagged by

1 Answer

Best answer
15 votes
15 votes
The expected number of probes in unsuccessful search is $\frac{1}{1-a} = 3$ where, $a$ = Load Factor = $\frac{2}{3}$

The expected number of probes in a successful search is $\frac{1}{a} * ln\frac{1}{1-a}$ = $1.647$
selected by

Related questions

1 votes
1 votes
1 answer
1
s_dr_13 asked Mar 6, 2019
959 views
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...
0 votes
0 votes
0 answers
3
HeadShot asked Nov 30, 2018
811 views
Anyone please give a solution to solve such question as it is difficult in one go.
0 votes
0 votes
2 answers
4
altamash asked Nov 5, 2018
2,549 views
can any one explain double hashing example