Hashing MCQ question and answer with solution | Data Structure MCQs

A. Linear probing

B. Quadratic probing

C. Double hashing

D. Closed hashing

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Hashing

B. Collision

C. Chaining

D. Open addressing

A. hash function

B. hash linked list

C. hash tree

D. hash chaining

A. It saves time

B. It saves space

C. It saves both time and space

D. It reduces code complexity

A. O (log n!)

B. O (n!)

C. Ω (n²)

D. Ω (n)

A. A structure that maps values to keys

B. A structure that maps keys to values

C. A structure used for storage

D. A structure used to implement stack and queue

A. O (log k!)

B. O (k!)

C. O (k²)

D. O (1/k^1/2)

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. 123

B. 456

C. 70

D. 67