ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
12 practice sets · Page 1 of 1
Jump search has a worst case time complexity of O(n).
True
False
The time complexity of jump search is O(n^{1/2}) in worst and average case. It is due to the fact that size of optimal jump is n^{1/2}.
Jump search is worse than linear search in terms of time complexity.
True
False
Linear search has a time complexity of O(n) and the time complexity of jump search is O(n^{1/2}). So jump search is better than linear search in terms of time complexity.
Best case of jump search will have time complexity of _________
O(1)
O(n)
O(log n)
O(n log n)
Best case of jump search will be when the first element of the array is the element that is being searched. In this case only one comparison will be required. Thus it will have a time complexity of O(1).
In which of the following case jump search will be preferred over binary search?
jumping backwards takes significantly more time than jumping forward
jumping forward takes significantly more time than jumping backwards
when the given array is very large in size
when the given array is very small in size
Jump search only needs to jump backwards once, while a binary can jump backwards up to log n times. Thus jump search will be preferred over binary search if jumping backwards is expensive.
Which of the following searching algorithm is fastest?
jump search
binary search
linear search
all are equally fast
Binary search has the least time complexity (equal to log n) out of the given searching algorithms. This makes binary search preferable in most cases.
What is the auxiliary space requirement of the jump search?
O(n)
O(log n)
O(n^{1/2})
O(1)
Jump search does not require any additional space for searching the required element. Thus its auxiliary space requirement will be O(1).
What is the value of jump taken for maximum efficiency while implementing jump search?
n/2
n^{2}
n^{1/2}
log n
Total number of comparisons required will be n/k + k-1 in worst case. This function will be minimum for k=n^{1/2}. So this value of jump will be the best for implementing jump search.
What will be the maximum number of comparisons that can be made in jump search algorithm (assuming k to be blocks jumped)?
k
n/k
k-1
k-1
Worst case occurs when the element being searched is present just after the element that has been compared while making the last jump. So, in this case k-1 comparisons will have to be made.
How many jumps will be made in the worst case of jump search(let block jumped =k)?
n*k
n/k
k/n
n+k
Worst case occurs when the value to be searched is in the last section of the array. So, in this case the number of jumps will be n/k.
Which of the following step is taken after finding an element having value greater than the element being searched in jump search?
linear search takes place in the forward direction
linear search takes place in the backward direction
binary search takes place in the forward direction
binary search takes place in a backward direction
First an element having value greater than the element being searched is found. After this linear search is performed in a backward direction.
Jumps are made in the jump search algorithm until ___________
element having value less than that of the required element is found
element having value equal to the median of values of the array is found
element having value greater than that of the required element is found
middle element is found equal to the element being searched
In jump search algorithm jumps are made until element having value greater than the value of element being searched is found. After this linear search is performed in backwards direction.
Jump search algorithm requires which of the following condition to be true?
array should be sorted
array should have not be sorted
array should have a less than 64 elements
array should be partially sorted
Jump sort requires the input array to be sorted. The algorithm would fail to give the correct result if array is not sorted.
