Question 11 : In which of the following case jump search will be preferred over binary search?
1. jumping backwards takes significantly more time than jumping forward
2. jumping forward takes significantly more time than jumping backwards
3. when the given array is very large in size
4. when the given array is very small in size
5.
View Answer   Discuss with Members

Question 12 : Which of the following searching algorithm is fastest?
1. jump search
2. binary search
3. linear search
4. all are equally fast
5.
View Answer   Discuss with Members

Question 13 : What is the auxiliary space requirement of the jump search?
1. O(n)
2. O(log n)
3. O(n^1/2)
4. O(1)
5.
View Answer   Discuss with Members

Question 14 : 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
5.
View Answer   Discuss with Members

Question 15 : What will be the maximum number of comparisons that can be made in jump search algorithm (assuming k to be blocks jumped)?
1. k
2. n/k
3. k-1
4. k-1
5.
View Answer   Discuss with Members

Question 16 : How many jumps will be made in the worst case of jump search(let block jumped =k)?
1. n*k
2. n/k
3. k/n
4. n+k
5.
View Answer   Discuss with Members

Question 17 : Which of the following step is taken after finding an element having value greater than the element being searched?
1. linear search takes place in the forward direction
2. linear search takes place in the backward direction
3. binary search takes place in the forward direction
4. binary search takes place in a backward direction
5.
View Answer   Discuss with Members

Question 18 : Jumps are made in the jump search algorithm until ___________
1. element having value less than that of the required element is found
2. element having value equal to the median of values of the array is found
3. element having value greater than that of the required element is found
4. middle element is found equal to the element being searched
5.
View Answer   Discuss with Members

Question 19 : Jump search algorithm requires which of the following condition to be true?
1. array should be sorted
2. array should have not be sorted
3. array should have a less than 64 elements
4. array should be partially sorted
5.
View Answer   Discuss with Members

Question 20 : Which of the following false about Jump Search?
1. Jump Search is better than Linear Search
2. Useful when jumping back is more costly than jumping forward
3. Jump Search is worse than Binary Search
4. None of the mentioned
5.
View Answer   Discuss with Members