Multiple Choices
(Choose 1 answer)
0
0
0
0 203
Given the division hash function h(x) = x%M, where M = 10 and Collision Resolution
1
1
1
1
2
2
2
2
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).i=1, 2, ...
3
63
3
63
3
63
3
63
4
74
4
74
4
74
4
74
How the hash table looks like after inserting the following keys sequentially?63, 74, 94, 203
5
94
5
5
94
5
6
6
94
6 203
6
7
203
7
203
7
7
94
A. (3)
Β. (1)
8
8
8
8
9
9
9
9
C. (4)
D. (2)
(1)
(2)
(3)
(4)
