Hashing MCQ question and answer with solution | Data Structure MCQs

A. True

B. False

A. 100

B. 200

C. 300

D. 400

A. Every element has equal probability of hashing into any of the slots

B. A weighted probabilistic method is used to hash elements into the slots

C. Elements has Random probability of hashing into array slots

D. Elements are hashed based on priority

A. O(n)

B. O(logn)

C. O(nlogn)

D. O(1)

A. Distinct array position for every possible key

B. Fewer array positions than keys

C. Fewer keys than array positions

D. Same array position for all keys

A. hash table using a linked list for separate chaining

B. hash table using binary search tree for separate chaining

C. hash table using open addressing

D. hash table using a doubly linked list for separate chaining

A. True

B. False

A. True

B. False

A. Open addressing

B. Double hashing

C. Quadratic probing

D. Chaining using a binary tree

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)