3
Multiple choices 3/50
(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?65, 76, 96, 205
A. (4)
B. (1)
C. (3)
Next
D. (2)
0
0
205
0
0
1
205
2
2
2
2
3
3
3
3
4
4
4
4
5
65
5
65
5
65
5
65
6
76
6
76
6
76
6
76
7
7
96
7
96
7
96
8
96
8
8 205
8
9
9
9
205
(1)
(2)
(3)
(4)
1
2
3
4
5
6
7
8
9
10 11
12
13
14
15 16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45 46
47
48
49
50
