A hash table with ten buckets with one slot per bucket is shown in the…
PYQ GATE 1989
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols S₁ to S₇ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

Attempted by 12 students.
Sign up free to check your answer
Sign up freeLoading lesson…

