(43)
(Choose 1 answer)
0
0
107
0
37
0
37
Given the division hash function h(x) = x%M, where M = 10 and Collision
1
37
1
1
1
2
2
2
2
Resolution is quadratic probing.i.e. when inserting a key x, the collision is resolved by finding an available position at (h(x) + i^2)%M).
3
3
3
3
4
4
4
4
107
5
5
5
5
6
107
6
6
107
6
i=1, 2....
7
27
7
27
7
27
7
27
How the hash table looks like after inserting the following keys sequentially?27, 98, 37, 107
8
98
8
98
8
98
8
98
9
9
37
9
(1)
(2)
(3)
(4)
A. (1)
B. (4)
C. (3)
D. (2)
