☑Kizspy.me
(Choose 1 answer)
Given the division hash function
☐ A
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?
65. 76, 96, 205
Back
Next
A. (1)
B. (4)
C. (2)
D. (3)
FUO.sh
sh the exam.
0
0
205
1
205
1
2
3
234
456789
65
65
76
96
56789
76
96
96
76
96
205
9
205
(1)
(2)
(3)
(4)
0123456789
0
1
2
65
76
3
4
5678a
65
