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.

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.

It is a data structure that supports one of the efficient searching techniques, that is, hashing.

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.

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?

What is the meaning of O(1) time?