Hashing MCQ question and answer with solution | Data Structure MCQs

A. in digital currency

B. in sorting of large data

C. for indexing in databases

D. in encryption of data

A. it takes less memory

B. it is easy to implement

C. it makes the process of insertion and deletion faster

D. it causes less collisions

A. Linear probing

B. Quadratic probing

C. Double hashing

D. Rehashing

A. to calculate and return the index of corresponding data

B. to store data

C. to erase data

D. to change data

A. O (log n!)

B. O (n!)

C. O (n²)

D. O (n)

A. it should cause less collisions

B. it should cause more collisions

C. it should occupy less space

D. it should be easy to implement

A. h(k) = floor( m(kA mod 1))

B. h(k) = ceil( m(kA mod 1))

C. h(k) = floor(kA mod m)

D. h(k) = ceil( kA mod m)

A. BST is easier to implement

B. BST can get the keys sorted by just performing inorder traversal

C. BST can perform range query easily

D. Time complexity of hash table in inserting, searching and deleting is less than that of BST

A. Heap

B. Hash list

C. BST

D. B - tree

A. Ω

B. ∞

C. ∑

D. ⅄