Question 11 : What is a hash function?
1. A function has allocated memory to keys
2. A function that computes the location of the key in the array
3. A function that creates an array
4. None of the mentioned
View Answer   Discuss with Members

Question 12 : Which of the following is identical to that of a separate chaining hash node?
1. Linked list
2. Array
3. Stack
4. Queue
View Answer   Discuss with Members

Question 13 : Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ______ time.
1. O(logn)
2. O(n²)
3. O(nlogn)
4. O(n)
View Answer   Discuss with Members

Question 14 : What is the worst case search time of a hashing using separate chaining algorithm?
1. O(N log N)
2. O(N)
3. O(N²)
4. O(N³)
View Answer   Discuss with Members

Question 15 : Where does the number 14 get inserted in the following table?

Index	Key
0
1	79
2
3
4	69
5	98
6
7	72
8
9
10
11	50
12

1. 2
2. 9
3. 4
4. 8
View Answer   Discuss with Members

Question 16 : What is the value of h(k) for the key 123456?
Given: p=14, s=2654435769, w=32
1. 123
2. 456
3. 70
4. 67
View Answer   Discuss with Members

Question 17 : Which of the following is a widely used form of the hash tree?
1. B+ – tree
2. T tree
3. Tiger tree hash
4. Htree
View Answer   Discuss with Members

Question 18 : How many probes are required on average for insertion and successful search?
1. 4 and 10
2. 2 and 6
3. 2.5 and 1.5
4. 3.5 and 1.5
View Answer   Discuss with Members

Question 19 : What can be the value of m in the division method?
1. Any prime number
2. Any even number
3. 2^p – 1
4. 2^p
View Answer   Discuss with Members

Question 20 : What is the formula to find the expected number of probes for an unsuccessful search in linear probing?
1. ½(1+1/(1-⅄))
2. ½(1+1/(1-⅄)²)
3. ½(1+1/(1+⅄))
4. ½(1+1/(1+⅄)(1-⅄))
View Answer   Discuss with Members