Q141
Open questionWhat is the load factor for an open addressing technique?
Select an option to see the answer and solution.
Data Structure · all questionsHashing
Hashing
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
175
Questions
8/9
Page
Pick an option on a question to see the right answer and solution.
Q142
Open questionBy implementing separate chaining using list head we can reduce the number of collisions drastically.
Select an option to see the answer and solution.
Q143
Open questionA hash table may become full in the case when we use open addressing.
Select an option to see the answer and solution.
Q144
Open question. . . . . . . . is not a theoretical problem but actually occurs in real implementations of probing.
Select an option to see the answer and solution.
Q145
Open questionWhat is the disadvantage of hashing with chaining?
Select an option to see the answer and solution.
Q146
Open questionWhat is the worst case time complexity of insert function in the hash table when the list head is used for chaining?
Select an option to see the answer and solution.
Q147
Open questionIn linear probing, the cost of an unsuccessful search can be used to compute the average cost of a successful search.
Select an option to see the answer and solution.
Q148
Open questionWhich of the following is the correct function definition for linear probing?
Select an option to see the answer and solution.
Q149
Open questionWhat kind of deletion is implemented by hashing using open addressing?
Select an option to see the answer and solution.
Q150
Open questionIn a hash table of size 10, where is element 7 placed?
Select an option to see the answer and solution.
Q151
Open questionWhich of the following is the hashing function for separate chaining?
Select an option to see the answer and solution.
Q152
Open questionWhat data organization method is used in hash tables?
Select an option to see the answer and solution.
Q153
Open questionWhich of the following technique stores data in the hash table itself in case of a collision?
Select an option to see the answer and solution.
Q154
Open questionWhat is the expected error for estimating the Jaccard index using MinHash scheme for k different hash functions?
Select an option to see the answer and solution.
Q155
Open questionWhich of the following technique is used for handling collisions in a hash table?
Select an option to see the answer and solution.
Q156
Open questionWho invented the MinHash technique?
Select an option to see the answer and solution.
Q157
Open questionIn simple uniform hashing, what is the search complexity?
Select an option to see the answer and solution.
Q158
Open questionWhat is the table size when the value of p is 7 in multiplication method of creating hash functions?
Select an option to see the answer and solution.
Q159
Open questionWhat is the time complexity of the delete function in the hash table using a binary tree?
Select an option to see the answer and solution.
Q160
Open questionWhat is the time complexity to delete an element from the direct address table?
Select an option to see the answer and solution.