The Gateway to Computer Science Excellence
+1 vote
202 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 (299 points) | 202 views
0
for successful search $\frac{2}{10}$

unsuccessful search $\frac{8}{10}$
0
unsuccessful searches = 5

successful searches = 2 (approx)

Please log in or register to answer this question.

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,366 answers
198,496 comments
105,265 users