☑Kizspy.me
(Choose 1 answer)
0
0
36
☐ A
Given the division hash function
1
1
h(x)=x%M, where M = 10 and
Collision Resolution
2
2
is quadratic probing, i.e. when
inserting a key x. the collision is
3
3
resolved by finding an available
position at (h(x)+i^2)%M). i=1.
4
4 106
2,
5
5
How the hash table looks like
after inserting the following keys
6
26
6 26
sequentially?
26.97, 36, 106
7
97
Back
Next
8
26
7_8
97
A. (3)
9
106
9
012345678a
0
36
36
1
2
3
4
106
26
97
9
56789
106
26
97
B. (4)
(1)
(2)
(3)
(4)
C. (2)
D. (1)
FUO.sh
sh the exam.
