Hashing MCQ question and answer with solution | Data Structure MCQs

A. rehashing

B. extended hashing

C. separate chaining

D. open addressing

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Jaccard Index is Closer to 1

B. Jaccard Index is Closer to 0

C. Jaccard Index is Closer to -1

D. Jaccard Index is Farther to 1

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. True

B. False

A.

h1(k) = m mod k
    h2(k) =  1+ (m’ mod k)

B.

h1(k) = 1 + (m mod k)
    h2(k) =  m’ mod k

C.

h1(k) = 1+ (k mod m)
    h2(k) =  k mod m

D.

h1(k) = k mod m
    h2(k) =  1+ (k mod m’)

A. h(k) = k/m

B. h(k) = k mod m

C. h(k) = m/k

D. h(k) = m mod k

A. true

B. false

A. It requires many pointers

B. It requires linked lists

C. It uses array

D. It does not resolve collision

A. hash function

B. separate chaining

C. open addressing

D. chaining using a linked list