Question 1 : Which of the following problems occur due to linear probing?
1. Primary collision
2. Secondary collision
3. Separate chaining
4. Extendible hashing
View Answer   Discuss with Members

Question 2 : What is the correct notation for a load factor?
1. Ω
2. ∞
3. ∑
4. ⅄
View Answer   Discuss with Members

Question 3 : Which of the following techniques offer better cache performance?
1. Quadratic probing
2. Linear probing
3. Double hashing
4. Rehashing
View Answer   Discuss with Members

Question 4 : What kind of deletion is implemented by hashing using open addressing?
1. active deletion
2. standard deletion
3. lazy deletion
4. no deletion
View Answer   Discuss with Members

Question 5 : What is the table size when the value of p is 7 in multiplication method of creating hash functions?
1. 14
2. 128
3. 49
4. 127
View Answer   Discuss with Members

Question 6 : In simple chaining, what data structure is appropriate?
1. Singly linked list
2. Doubly linked list
3. Circular linked list
4. Binary trees
View Answer   Discuss with Members

Question 7 : What is the time complexity to insert an element into the direct address table?
1. O(n)
2. O(logn)
3. O(nlogn)
4. O(1)
View Answer   Discuss with Members

Question 8 : In simple uniform hashing, what is the search complexity?
1. O(n)
2. O(logn)
3. O(nlogn)
4. O(1)
View Answer   Discuss with Members

Question 9 : Which of the following is defined as the ratio of total elements of intersection and union of two sets?
1. Rope Tree
2. Jaccard Coefficient Index
3. Tango Tree
4. MinHash Coefficient
View Answer   Discuss with Members

Question 10 : What is simple uniform hashing?
1. Every element has equal probability of hashing into any of the slots
2. A weighted probabilistic method is used to hash elements into the slots
3. All of the mentioned
4. None of the mentioned
View Answer   Discuss with Members