Q. 51 A has 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 has table, the table is
as shown below.
How many different insertion sequences of the key values using hte same hash
function and linear probing will result in the hash table shown above ?
(A) 10
(B) 20
(C) 30
(D) 40
Answer: (C)
Explanation:
