2 votes 2 votes what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing?? DS data-structures hashing made-easy-test-series + – sushmita asked Mar 26, 2017 • recategorized Mar 5, 2019 by adeebafatima1 sushmita 448 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Akriti sood commented Mar 26, 2017 i edited by Akriti sood Mar 26, 2017 reply Follow Share i guess it is 1/a *log(1/1-a),this question had been asked before. https://gateoverflow.in/47720/what-is-the-expected-number-of-probes-in-a-successful-search 0 votes 0 votes set2018 commented Aug 18, 2017 reply Follow Share why we are not assuming case of unsuccessful search by this it may be 1/(1-alpha) probes . 0 votes 0 votes Please log in or register to add a comment.
