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