280 views
0 votes
0 votes
What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) .

there are two derivations given one leads to 1/(1-α)  and the other leads to 1/2(1+1/(1-α)^2)  

plz explain the distinction ?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
KISHALAY DAS asked Jan 10, 2017
278 views
ANS GIVEN A=169 B=13 HOW??
0 votes
0 votes
0 answers
4
ykrishnay asked Sep 6, 2022
531 views
which is best book for DBMS korth or navathe ?since i know that both book is great but i wanted to follow 1 particular book that is easy to understand and simple language...