The Gateway to Computer Science Excellence

Hashing

+1 vote
196 views
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?
in Algorithms by (283 points) | 196 views
0
for successful search $\frac{2}{10}$

unsuccessful search $\frac{8}{10}$
by Veteran (119k points)
0
unsuccessful searches = 5

successful searches = 2 (approx)
by Boss (23.5k points)

Please log in or register to answer this question.

← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →

Related questions

+2 votes
1 answer
4
Hashing+Probaility
asked Oct 8, 2016 in DS by Rahul Jain25 Boss (11.1k points) | 262 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,309 answers
198,338 comments
105,024 users