Hashing MCQ question and answer with solution | Data Structure MCQs

A. To balance a binary search tree.

B. To sort elements in a hash table.

C. To handle cases where multiple keys hash to the same index.

D. To improve the speed of hash function computation.

A. Division method

B. Multiplicative hashing

C. Modulo operation

D. Universal hashing

A. Increased number of collisions and reduced efficiency.

B. Decreased memory usage.

C. Improved search times.

D. Decreased need for resizing.

A. A technique for collision resolution.

B. A function used to compute hash values.

C. A method of resizing the hash table.

D. A slot in the hash table where elements are stored.

A. The hash table elements are sorted.

B. The hash function is changed.

C. The hash table is resized and all elements are rehashed to new indices.

D. The hash table is cleared.

A. By chaining elements in a linked list.

B. By searching sequentially for the next available slot.

C. By quadratic probing.

D. By chaining elements in a linked list.

A. It is less efficient than linear probing.

B. It has slower insertion times.

C. It may lead to secondary clustering.

D. It requires more memory than chaining.

A. Inserting elements

B. Searching for elements

C. Deleting elements

D. Sorting elements

A. It generally reduces the load factor and collisions.

B. It increases the load factor and collisions.

C. It decreases memory usage.

D. It does not affect performance.

A. Chaining

B. Double hashing

C. Linear probing

D. Quadratic probing