Hashing MCQ question and answer with solution | Data Structure MCQs

A. H(x)=(hash(x)+f(i)) mod table size

B. H(x)=hash(x)+i² mod table size

C. H(x)=x mod table size

D. H(x)=x mod (table size * 2)

A. Stack

B. Array

C. Linked list

D. Queue

A. Open addressing

B. Chaining using linked list

C. Chaining using doubly linked list

D. Chaining using binary tree

A. O (log k!)

B. O (k!)

C. O (k²)

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

A. Open addressing

B. Hashing

C. Searching

D. Hash function

A. Weiner

B. Samuel F. B. Morse

C. Friedrich Clemens Gerke

D. Andrei Broder

A. O(n)

B. O(logn)

C. O(nlogn)

D. O(1)

A. 14

B. 128

C. 49

D. 127

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. O(n)

B. O(logn)

C. O(nlogn)

D. O(1)