Q101
Open questionWhat is the time complexity to insert an element into the direct address table?
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
6/9
Page
Pick an option on a question to see the right answer and solution.
Q102
Open questionWhat will be the height of the hash tree with branching factor 2 and with 8 records?
Select an option to see the answer and solution.
Q103
Open questionWhat is the hash function used in Double Hashing?
Select an option to see the answer and solution.
Q104
Open questionWhich of the following is not a technique to avoid a collision?
Select an option to see the answer and solution.
Q105
Open questionWhat is the advantage of a hash table as a data structure?
Select an option to see the answer and solution.
Q106
Open questionWhich of the following is the correct function definition for quadratic probing?
Select an option to see the answer and solution.
Q107
Open questionWhich of the following techniques offer better cache performance?
Select an option to see the answer and solution.
Q108
Open questionWhat is the hash function used in linear probing?
Select an option to see the answer and solution.
Q109
Open questionSeparate chaining is easier to implement as compared to open addressing.
Select an option to see the answer and solution.
Q110
Open questionIs MinHash used as a tool for association rule learning.
Select an option to see the answer and solution.
Q111
Open questionWhat is the worst case time complexity of the insertion in the hash tree?
Select an option to see the answer and solution.
Q112
Open questionThe task of generating alternative indices for a node is called?
Select an option to see the answer and solution.
Q113
Open questionWhat can be the value of m in the division method?
Select an option to see the answer and solution.
Q114
Open questionUsing division method, in a given hash table of size 157, the key of value 172 be placed at position . . . . . . . .
Select an option to see the answer and solution.
Q115
Open questionHash tree is also known as . . . . . . . .
Select an option to see the answer and solution.
Q116
Open questionWhat is the running time of double hashing?
Select an option to see the answer and solution.
Q117
Open questionIf several elements are competing for the same bucket in the hash table, what is it called?
Select an option to see the answer and solution.
Q118
Open questionWhen is it appropriate to use direct addressing?
Select an option to see the answer and solution.
Q119
Open questionWhat is the advantage of using linked list over the doubly linked list for chaining?
Select an option to see the answer and solution.
Q120
Open questionWhich scheme provides good performance?
Select an option to see the answer and solution.