In a hash table with 'n' slots using chaining for collision resolution, what…

TPSC Computer/IT Posts 2026

In a hash table with 'n' slots using chaining for collision resolution, what is the average time complexity for search in the worst case ?

  1. A.

    O(1)

  2. B.

    O(log n)

  3. C.

    O(n)

  4. D.

    O(n^2)

Attempted by 623 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…