Hashing MCQ question and answer with solution | Data Structure MCQs

A. it is simpler to implement

B. table never gets full

C. it is less sensitive to hash function

D. it has better cache performance

A. hash table has a better average time complexity for performing insert, delete and search operations

B. hash table requires less space

C. range query is easy with hash table

D. easier to implement

A. 1

B. 2

C. 3

D. 4

A. Hash key = key mod table size

B. Hash key=(hash(x)+F(i)) mod table size

C. Hash key=(hash(x)+F(i²)) mod table size

D. H(x) = x mod 17

A. Quadratic probing

B. Linear probing

C. Double hashing

D. Separate chaining

A. True

B. False

A. only 2 steps are involved

B. using constant

C. value of m not critical

D. simple multiplication

A. faster access of data

B. easy to implement

C. very efficient for less number of entries

D. exhibit good locality of reference

A. True

B. False

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)