The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty…

GATE · 2009 · CS

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?

A.
Index
Values
0
1
2
2
3
23
4
5
15
6
7
8
18
9
B.
Index
Values
0
1
2
12
3
13
4
5
5
6
7
8
18
9
C.
Index
Values
0
1
2
12
3
13
4
2
5
3
6
23
7
5
8
18
9
15
D.
Index
Values
0
1
2
12, 2
3
13, 3, 23
4
5
5, 15
6
7
8
18
9

Index	Values
0
1
2	2
3	23
4
5	15
6
7
8	18
9

Index	Values
0
1
2	12
3	13
4
5	5
6
7
8	18
9

Index	Values
0
1
2	12
3	13
4	2
5	3
6	23
7	5
8	18
9	15

Index	Values
0
1
2	12, 2
3	13, 3, 23
4
5	5, 15
6
7
8	18
9

Attempted by 394 students.

Explore the full course: Gate Guidance By Sanchit Sir