6 practice sets · Page 1 of 1
What is the time complexity of Jump Search?
O(logn)
O(n)
O(sqrt(n))
O(nlogn)
Correct Answer: C — O(sqrt(n))
Explanation:
Since the size of the step is sqrt(n), the complexity is also obviously O(sqrt(n)).
What is the length of the step in jump search?
n
n/2
sqrt(n)
1
Correct Answer: C — sqrt(n)
Explanation:
If the step size is 1, it becomes a linear search, if it is n, we reach the end of the list in just on step, if it is n/2, it becomes similar to binary search, therefore the most efficient step size is found to be sqrt(n).
Which of the following is not an advantage of Fibonacci Search?
When the element being searched for has a non uniform access storage
Can be used in magnetic tapes
Can be used for large arrays which do not fit in the CPU cache or in the RAM
It can be applied efficiently on unsorted arrays
Correct Answer: D — It can be applied efficiently on unsorted arrays
Explanation:
When the speed of access depends on the location previously accessed, Fibonacci search is better compared to binary search as it performs well on those locations which have lower dispersion. Fibonacci search won't work on unsorted arrays. The input should be a sorted array or array should be sorted before Fibonacci search.
What is the time complexity of Fibonacci Search?
O(logn)
O(n)
O(n^{2})
O(nlogn)
Correct Answer: A — O(logn)
Explanation:
Since it divides the array into two parts, although not equal, its time complexity is O(logn), it is better than binary search in case of large arrays.
Choose the recursive formula for the Fibonacci series.(n>=1)
(F(n) = F(n+1) + F(n+2))
(F(n) = F(n) + F(n+1))
(F(n) = F(n-1) + F(n-2))
(F(n) = F(n-1) - F(n-2))
Correct Answer: C — (F(n) = F(n-1) + F(n-2))
Explanation:
None.
Which algorithmic technique does Fibonacci search use?
Brute force
Divide and Conquer
Greedy Technique
Backtracking
Correct Answer: B — Divide and Conquer
Explanation:
With every iteration, we divide the given array into two sub arrays(not necessarily equal).
