A hash table of length 10 uses open addressing with the hash function h(k) = k…
GATE · 2010 · CS · Computer Science & IT
A hash table of length 10 uses open addressing with the hash function h(k) = k mod 10 and linear probing. After six values are inserted into an empty table, the following table is obtained:
Which of the following could be the insertion order?
- 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
Attempted by 466 students.
Sign up free to check your answer
Sign up freeLoading lesson…