Font size
WorksheetsQuiz No. 2.2 Hash Tables
Total questions: 12
Worksheet time: 11mins
In this method of collision resolution technique, all the elements are stored in the hash table itself.
Chaining Method
Open-Addressing Method
It is the simplest approach to resolving the problem of collision in hashing.
(a)
Which of the following is not a type of open-addressing method?
Linear Probing
Quadratic Probing
Binary Probing
Double Hashing
It is a mathematical formula that when applied to a key, produces an integer used as an index to find a key in the hash table.
(a)
It is a data structure that supports one of the efficient searching techniques, that is, hashing.
(a)
In this method, a key 'k' is mapped into one of the 'm' slots by taking the remainder of 'k' divided by 'm'.
Mid-Square Method
Quadratic Probing
Division Method
Folding Method
In this method of collision resolution technique, a chain of elements is maintained that have the same hash address.
(a)
Which collision resolution technique has this formula?
h'(k) = (h(k) + i) mod m
Linear Probing
Quadratic Probing
Double Hashing
What is the operator that we use to get a range of key values in a hash table?
(a)
What is the meaning of O(1) time?
(a)
What have you learned in our Data Structures and Algorithms course?
Do you think you deserve a bonus?
