What is the average time complexity for searching in a hash table under reasonable assumptions?

O(1)

Which data structure is implemented as a self-balancing red-black tree in C++?

STL Map

True or False: A direct access table allows quick O(1) time complexity for all operations without any limitations.

False. Direct access tables have significant space requirements and limitations on the size of keys.

Fill in the blank: A good hash function should efficiently distribute the keys and be ______.

Computable

Riddle: I can become crowded with many keys, but I’m designed to keep values organized without a strict order. What am I?

Hash table

What is the time complexity for insert and delete operations in a balanced binary search tree?

O(Log n)

Which collision handling technique involves making each cell of a hash table point to a linked list?

Chaining

True or False: Open addressing has better cache performance compared to chaining.

True

Fill in the blank: In linear probing, if the slot hash(x) % S is full, we try (hash(x) + ______) % S.

1

What is the primary limitation of the direct access table method?

High space requirement

Riddle: I use two functions to find my place, but my cache performance is not the best. What am I?

Double hashing

What is the expected time to delete an element in a hash table with a load factor α?

O(1 + α)

Which technique splits a bucket into two parts when it exceeds a certain size in extendible hashing?

Bucket Splitting

True or False: Hash tables store their values in sorted order.

False. Hash tables do not store values in sorted order.

Fill in the blank: The probability of collisions increases with the ______ of the hash table.

Load factor