A good hash approach is to derive the hash value that is expected to be dependent of any patterns that might exist in the data.
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
4/9
Page
Pick an option on a question to see the right answer and solution.
How many hashes will be needed for calculating Jaccard index with an expected error less than or equal to 0.05?
Select an option to see the answer and solution.
What is simple uniform hashing?
Select an option to see the answer and solution.
What is the search complexity in direct addressing?
Select an option to see the answer and solution.
What is direct addressing?
Select an option to see the answer and solution.
Which of the following variant of a hash table has the best cache performance?
Select an option to see the answer and solution.
Sequential access in a Hash tree is faster than in B-trees.
Select an option to see the answer and solution.
The value of h2(k) can be composite relatively to the hash table size m.
Select an option to see the answer and solution.
Which of the following technique stores data separately in case of a collision?
Select an option to see the answer and solution.
What is the time complexity of search function in a hash table using a doubly linked list?
Select an option to see the answer and solution.
Which technique has the greatest number of probe sequences?
Select an option to see the answer and solution.
What is the time complexity of the search function in a hash table using a binary tree?
Select an option to see the answer and solution.
The case in which a key other than the desired one is kept at the identified location is called?
Select an option to see the answer and solution.
Which of the following is used in hash tables to determine the index of any input record?
Select an option to see the answer and solution.
How is a bit vector better compared to a normal array for implementing the hash table?
Select an option to see the answer and solution.
How many bits are needed to specify the single permutation by min-wise independent family?
Select an option to see the answer and solution.
What is a hash table?
Select an option to see the answer and solution.
What is the expected error by the estimator Chernoff bound on the samples performed without replacement?
Select an option to see the answer and solution.
What is the time complexity of delete function in the hash table using list head?
Select an option to see the answer and solution.
What is the value of h(k) for the key 123456?
Given: p=14, s=2654435769, w=32
Given: p=14, s=2654435769, w=32
Select an option to see the answer and solution.