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). Algorithms hashing + – srestha asked Jan 16, 2017 • retagged Jun 18, 2022 by makhdoom ghaya srestha 3.2k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply saurabh rai commented Jan 16, 2017 reply Follow Share 1.647 ? 0 votes 0 votes srestha commented Jan 16, 2017 reply Follow Share go detail plz :) 0 votes 0 votes srestha commented Jan 16, 2017 reply Follow Share @ saurabh plz show calculation 0 votes 0 votes Please log in or register to add a comment.
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$ Kapil answered Jan 16, 2017 • selected Jan 16, 2017 by srestha Kapil comment Share Follow See all 0 reply Please log in or register to add a comment.