GATE | GATE CS 2010 | Question 52

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below.



Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

(A) 46, 42, 34, 52, 23, 33
(B) 34, 42, 23, 52, 33, 46
(C) 46, 34, 42, 23, 52, 33
(D) 42, 46, 33, 23, 34, 52


Answer: (C)

Explanation: See question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-24/

Quiz of this Question