A hash table with 10 buckets with one slot per bucket is depicted here. The…

ISRO Scientist/Engineer SC 2018ISRO Scientist/Engineer SC 2015

A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

Index

Value

0

S7

1

S1

2

3

S4

4

S2

5

6

S5

7

8

S6

9

S3

  1. A.

    4

  2. B.

    5

  3. C.

    6

  4. D.

    3

Attempted by 609 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…