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

ISRO Scientist/Engineer SC · 2018 · Computer ScienceISRO Scientist/Engineer SC · 2015 · Computer Science

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 528 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…