Question 111 : What is the value of jump taken for maximum efficiency while implementing jump search?
1. n/2
2. n²
3. n^1/2
4. log n
View Answer   Discuss with Members

Question 112 : The array is as follows: 1,2,3,6,8,10. At what time the element 6 is found? (By using linear search(recursive) algorithm)
1. 4th call
2. 3rd call
3. 6th call
4. 5th call
View Answer   Discuss with Members

Question 113 : What are the applications of binary search?
1. To find the lower/upper bound in an ordered sequence
2. Union of intervals
3. Debugging
4. All of the mentioned
View Answer   Discuss with Members

Question 114 : Choose the recursive formula for the Fibonacci series.(n>=1)
1. F(n) = F(n+1) + F(n+2)
2. F(n) = F(n) + F(n+1)
3. F(n) = F(n-1) + F(n-2)
4. F(n) = F(n-1) – F(n-2)
View Answer   Discuss with Members

Question 115 : What are the advantages of Fibonacci Search?
1. When the element being searched for has a non uniform access storage
2. Can be used in magnetic tapes
3. Can be used for large arrays which do not fit in the CPUcache or in the RAM
4. All of the mentioned
View Answer   Discuss with Members

Question 116 : Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
1. 90 and 99
2. 90 and 100
3. 89 and 94
4. 94 and 99
View Answer   Discuss with Members

Question 117 : What is the best case runtime of linear search(recursive) algorithm on an ordered set of elements?
1. O(1)
2. O(n)
3. O(logn)
4. O(nx)
View Answer   Discuss with Members

Question 118 : Given, arr = {1,3,5,6,7,9,14,15,17,19} key = 17 and delta = {5,3,1,0}
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
1. 4
2. 3
3. 5
4. 6
View Answer   Discuss with Members