Hashing MCQ question and answer with solution | Data Structure MCQs

A. Hashing is used for sequential access

B. Indexing is used for direct access

C. Hash tree allows only sequential access

D. Hashing is used for direct access

A. 11

B. 18

C. 17

D. 15

A. Average array size

B. Average key size

C. Average chain length

D. Average hash table length

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. O(N log N)

B. O(N)

C. O(N²)

D. O(N³)

A. hashing by division

B. hashing by multiplication

C. universal hashing

D. open addressing

A. Open addressing

B. Chaining using doubly linked list

C. Linear probing

D. Double hashing

A. MinHash

B. Stack

C. Priority Queue

D. PAT Tree

A. cache performance is good

B. uses less space

C. less sensitive to hash function

D. has a time complexity of O(n) in the worst case

A. O(logn)

B. O(n²)

C. O(nlogn)

D. O(n)