Vidyalelo
Data Structure · all questions

Hashing
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

175

Questions

9/9

Page

Pick an option on a question to see the right answer and solution.

What should be the load factor for separate chaining hashing?

Select an option to see the answer and solution.

In quadratic probing, if the table size is prime, a new element cannot be inserted if the table is half full.

Select an option to see the answer and solution.

Which of the following is a widely used form of the hash tree?

Select an option to see the answer and solution.

Which of the following is defined as the ratio of total elements of intersection and union of two sets?

Select an option to see the answer and solution.

What is the time complexity of insert function in a hash table using a doubly linked list?

Select an option to see the answer and solution.

What is the advantage of using a dynamic set in direct addressing?

Select an option to see the answer and solution.

What is the average retrieval time when n keys hash to the same slot?

Select an option to see the answer and solution.

How many steps are involved in creating a hash function using a multiplication method?

Select an option to see the answer and solution.

Quadratic probing overcomes primary collision.

Select an option to see the answer and solution.

Which technique is used for finding similarity between two sets?

Select an option to see the answer and solution.

Which hash function satisfies the condition of simple uniform hashing?

Select an option to see the answer and solution.

Which of the following is not a collision resolution technique?

Select an option to see the answer and solution.

In hash tables, how many traversal of links does a successful search require?

Select an option to see the answer and solution.

Hashing is the problem of finding an appropriate mapping of keys into addresses.

Select an option to see the answer and solution.

What is the formula to find the expected number of probes for an unsuccessful search in linear probing?

Select an option to see the answer and solution.