Hashing MCQ question and answer with solution | Data Structure MCQs

A. O(log_k(n))

B. O(n²)

C. O(nlog_k(n))

D. O(kn)

A. Collision handling

B. Collision detection

C. Collision recovery

D. Closed hashing

A. Any prime number

B. Any even number

C. 2^p - 1

D. 2^p

A. 19

B. 72

C. 15

D. 17

A. Merkle tree

B. T -tree

C. Hash table

D. B^x-tree

A. Theta(m)

B. Theta(m²)

C. Theta(m log k)

D. Theta(m³)

A. Diffusion

B. Replication

C. Collision

D. Duplication

A. When the array is comparatively large

B. When the universe U of keys is reasonably small

C. When the universe U of keys is reasonably large

D. When the array is comparatively small

A. it takes less memory

B. it causes more collisions

C. it makes the process of insertion and deletion faster

D. it causes less collisions

A. open addressing

B. universal hashing

C. hashing by division

D. hashing by multiplication