1,128 views
3 votes
3 votes
Given the input sequence {11,33,43,79,19} and hash table of size 10 with the hash function h(k)=k mod 10. If hash tables uses quadratic probing,the number of collisions occured while mapping the given sequence is?

1 Answer

2 votes
2 votes

$$\begin{align*} &h(k,i) = \left [ h(k) + i^2 \right ] \text {mod } 10 \end{align*}$$

Where $ i = 0,1,2,3,4....$

edited by

Related questions

5 votes
5 votes
3 answers
1
mcjoshi asked Aug 30, 2016
5,513 views
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resoluti...
1 votes
1 votes
0 answers
4
Hira Thakur asked Oct 31, 2017
383 views
which is correct method for QP :1) 2) H(k) = (H+ i^2)mod m