Hashing - Study Mode
[#1] What is the time complexity to insert an element into the direct address table?
Correct Answer
(D) O(1)
[#2] What will be the height of the hash tree with branching factor 2 and with 8 records?
Correct Answer
(C) 4
[#3] What is the hash function used in Double Hashing?
Correct Answer
(C) (h1(k) + i*h2(k))mod m
[#4] Which of the following is not a technique to avoid a collision?
Correct Answer
(D) Increasing hash table size
[#5] What is the advantage of a hash table as a data structure?
Correct Answer
(A) faster access of data