Hashing MCQ question and answer with solution | Data Structure MCQs

A. Simplifies the hash function.

B. Increases the load factor of the hash table.

C. Reduces clustering of elements.

D. Reduces the memory usage.

A. Linear probing

B. Double hashing

C. Quadratic probing

D. Linear probing

A. When insertions and deletions are infrequent.

B. When memory usage is a primary concern.

C. When the hash table is highly dynamic and frequently grows.

D. When the hash table is mostly static and does not grow.

A. Decreased time complexity for lookups.

B. Improved distribution of keys.

C. Decreased time complexity for insertions.

D. Increased number of collisions.

A. Universal hashing

B. Simple modulo operation

C. Multiplicative hashing

D. Division method

A. Quadratic probing

B. Linear probing

C. Open addressing

D. Chaining

A. Increased memory usage.

B. Faster computation of hash values.

C. Increased number of collisions and poor distribution of keys.

D. Better performance in load-balanced tables.

A. It sorts elements in the hash table.

B. It increases the size of the hash table and re-calculates indices for all elements.

C. It adds new elements to the hash table.

D. It sorts elements in the hash table.

A. When using quadratic probing.

B. When the hash function is very complex.

C. When the table size is not a prime number.

D. When the table size is a prime number.

A. Linear probing

B. Quadratic probing

C. Double hashing

D. Chaining