Consider a hash table of size 10 with indices \(\{0,1,\ldots,9\}\), with the…

PYQ GATE 2025

Consider a hash table of size 10 with indices {0,1,…,9}\{0,1,\ldots,9\}, with the hash function h(x)=3x(mod10)h(x)=3x \pmod{10}, where linear probing is used to handle collisions. The hash table is initially empty and then the following sequence of keys is inserted into the hash table: 1, 4, 5, 6, 14, 15. The indices where the keys 14 and 15 are stored are, respectively

  1. A.

    2 and 5

  2. B.

    2 and 6

  3. C.

    4 and 5

  4. D.

    4 and 6

Attempted by 39 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…