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 ?
- A.
O(1)
- B.
O(log n)
- C.
O(n)
- D.
O(n^2)
Attempted by 623 students.
Sign up free to check your answer
Sign up freeLoading lesson…

