A hash table with ten buckets with one slot per bucket is shown in the fig,…

A hash table with ten buckets with one slot per bucket is shown in the fig, with the symbols S1 to S7 entered into it using some hashing function with linear probing. The worst case comparisons of element required when the symbol being searched is not in the table is…………….

image.png

  1. A.

    5

  2. B.

    2

  3. C.

    7

  4. D.

    None

Attempted by 333 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…