What is the average time complexity for searching in a hash table under reasonable assumptions? | Card: 1 / 30 |
True or False: A direct access table allows quick O(1) time complexity for all operations without any limitations. | Card: 5 / 30 |
False. Direct access tables have significant space requirements and limitations on the size of keys. | Card: 6 / 30 |
Fill in the blank: A good hash function should efficiently distribute the keys and be ______. | Card: 7 / 30 |
Riddle: I can become crowded with many keys, but I’m designed to keep values organized without a strict order. What am I? | Card: 9 / 30 |
What is the time complexity for insert and delete operations in a balanced binary search tree? | Card: 11 / 30 |
Which collision handling technique involves making each cell of a hash table point to a linked list? | Card: 13 / 30 |
True or False: Open addressing has better cache performance compared to chaining. | Card: 15 / 30 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
Fill in the blank: In linear probing, if the slot hash(x) % S is full, we try (hash(x) + ______) % S. | Card: 17 / 30 |
Riddle: I use two functions to find my place, but my cache performance is not the best. What am I? | Card: 21 / 30 |
What is the expected time to delete an element in a hash table with a load factor α? | Card: 23 / 30 |
Which technique splits a bucket into two parts when it exceeds a certain size in extendible hashing? | Card: 25 / 30 |
Fill in the blank: The probability of collisions increases with the ______ of the hash table. | Card: 29 / 30 |






