GK Question

technology medium mcq

Which operation has O(1) time complexity in a well-implemented hash table?

  1. Search
  2. Insert
  3. Delete
  4. All of these

Answer: All of these

Hash tables provide average-case O(1) for search, insert, and delete by computing index via hash function. Worst-case O(n) occurs with many collisions. Load factor < 0.75 and good hash functions maintain performance. Understanding complexity trade-offs is essential for algorithm design questions.

Topic Data Structures
Exam Relevance SSC JE, Banking IT, UPSC