☑Kizspy.me
☐ A
(Choose 1 answer)
Given the division hash function h(x) = x%M, where M = 10 and Collision 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), i=1, 2, ...
How the hash table looks like after inserting the following keys sequentially?
34. 65, 94, 204
A. (3)
B. (4)
C. (2)
Back
Next
D. (1)
FUQ.sh
sh the exam.
0
1
2
3
204
4
34
65
56789
94
(1)
O-
0
0
1
1
204
34
65
24
94
94
23456789
2
204
34
65
(2)
(3)
94
94
204
(4)
3456789
34
65
012345678
9
