recategorized by
475 views
0 votes
0 votes

How to solve such kind of questions ? 

Can anybody tell what's is the concept behind this ??

 someone provide me link so that I read it and understand the actual  concept

 

recategorized by

1 Answer

0 votes
0 votes
Number of probes in unsuccessful search  = $\displaystyle \frac{1}{1-x}$
where x= load factor of hash table
since, x = $\displaystyle \frac{5}{6 }$

Therefore using above formula , x= $\displaystyle \frac{5}{6 }$ , as no. of probes in unsuccessful  search= 6.

Related questions

0 votes
0 votes
1 answer
2
Ram Swaroop asked Jan 27, 2019
1,263 views
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...
0 votes
0 votes
0 answers
3
Jyoti Kumari97 asked Nov 25, 2018
544 views
What is the number of collisions while doing insert operation on the hash table? Options are 3456Answer is 4Can anyone tell me how? ​​