793 views
0 votes
0 votes

Exercise 11.4.1

Consider inserting the keys 10,22,31,4,15,28,17,88,59 into a hash table of length m=11 using open addressing with the auxiliary hash function h′(k)=k. Illustrate the result of inserting these keys using linear probing, using quadratic probing with c1=1 and c2=3, and using double hashing h1(k)=k and h2(k)=1+(kmod(m+1)).

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
altamash asked Nov 5, 2018
2,549 views
can any one explain double hashing example
0 votes
0 votes
1 answer
2
5 votes
5 votes
2 answers
3
sunil sarode asked Dec 30, 2017
4,274 views
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) ...
1 votes
1 votes
1 answer
4
Anil Khatri asked Sep 28, 2016
995 views
double hashing satisfies the uniform hashing assumption.TRUE/FALSEexplain