Hashing MCQ question and answer with solution | Data Structure MCQs

A. The process of chaining elements together.

B. The process of hashing elements for the first time.

C. The process of resizing and rehashing all elements when the table is full.

D. The process of finding an element in the hash table.

A. Open addressing

B. Linear probing

C. Double hashing

D. Chaining

A. Universal hashing

B. Division method

C. Multiplicative method

D. Randomized hashing

A. By avoiding the use of chaining.

B. By using a less complex hash function.

C. By decreasing the size of the hash table.

D. By increasing the size of the hash table and using a good hash function.

A. Increased memory usage.

B. Decreased speed of hash functions.

C. Clustering of elements can occur.

D. Difficulty in implementing the hash function.

A. Better performance with low load factors.

B. Increased memory usage due to the storage of pointers.

C. Simplified implementation.

D. Better performance with low load factors.

A. To minimize memory usage.

B. To sort keys in ascending order.

C. To uniformly distribute keys across the hash table.

D. To generate the maximum number of collisions.

A. Using a linked list at each slot.

B. Using multiple hash functions.

C. Using a secondary hash table.

D. Using probing techniques to find an open slot.

A. Quadratic probing

B. Linear probing

C. Double hashing

D. Chaining

A. The entry is added to a linked list.

B. A new hash function is applied.

C. The table is resized.

D. The next available slot is searched.