The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
16 views
Consider an open-address hash table with uniform hashing. Give upper bounds on the expected number of probes in an unsuccessful search and on the expected number of probes in a successful search when the load factor is $3/4$ and when it is $7/8$.
in Algorithms by Boss (41.3k points) | 16 views

Please log in or register to answer this question.

Related questions

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
49,832 questions
54,800 answers
189,505 comments
80,726 users