The average search time for a hash table using separate chaining with a load factor α is:

The average search time for a hash table using separate chaining with a load factor α is:

  1. a) O(1 + α)
  2. b) O(α²)
  3. c) O(log α)
  4. d) O(α)

From the BCS Technical Cadre (ICT) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 6 of 106.

More from this paper