Hashing MCQ question and answer with solution | Data Structure MCQs

A. To provide constant time complexity for searches.

B. To sort elements in ascending order.

C. To balance binary search trees.

D. To implement priority queues.

A. When two elements are stored in the same slot.

B. When a hash table exceeds its capacity.

C. When a hash function fails to produce a unique index.

D. When two keys hash to the same index.

A. Inorder traversal

B. Depth-first search

C. Linear probing

D. Binary search

A. To balance a binary search tree.

B. To map data to a fixed-size value.

C. To find the maximum element in a set.

D. To balance a binary search tree.

A. Rehashing

B. Chaining

C. Double hashing

D. Linear probing

A. O(log n)

B. O(n)

C. O(n log n)

D. O(1)

A. The ratio of the number of elements to the number of slots.

B. The time complexity of hash functions.

C. The number of collisions in the hash table.

D. The capacity of the hash table.

A. Easy to compute.

B. Distributes keys uniformly across the hash table.

C. Minimizes collisions.

D. Produces random and unpredictable results.

A. Better handling of collisions.

B. Faster search times in all cases.

C. Reduced memory usage.

D. Simpler implementation.

A. A new hash table is created.

B. The next slot is checked sequentially.

C. The element is placed in a new hash table.

D. A new hash table is created.