A Hash Function f is defined as f(key) = key mod 7. With linear probing, while…

ISRO Scientist/Engineer SC · 2016 · Computer Science

A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (Count table index 0 as 0thlocation)?

  1. A.

    3

  2. B.

    4

  3. C.

    5

  4. D.

    6

Attempted by 553 students.

Show answer

Correct answer: C

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…