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? Algorithms hashing data-structures uniform-hashing probability + – s_dr_13 asked Mar 6, 2019 s_dr_13 981 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply srestha commented Mar 7, 2019 reply Follow Share for successful search $\frac{2}{10}$ unsuccessful search $\frac{8}{10}$ 0 votes 0 votes MiNiPanda commented Mar 8, 2019 reply Follow Share unsuccessful searches = 5 successful searches = 2 (approx) 1 votes 1 votes Please log in or register to add a comment.
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)$ smsubham answered Mar 7, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.