# Data Structure Questions and Answers-Fibonacci Search

## Data Structure Questions and Answers-Fibonacci Search

Congratulations - you have completed Data Structure Questions and Answers-Fibonacci Search.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

 Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which algorithmic technique does Fibonacci search use?
 A Brute force B Divide and Conquer C Greedy Technique D Backtracking
Crack any exam
Question 1 Explanation:
With every iteration, we divide the given array into two sub arrays(not necessarily equal).

 Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Choose the recursive formula for the Fibonacci series.(n>=1)
 A F(n) = F(n+1) + F(n+2) B F(n) = F(n) + F(n+1) C F(n) = F(n-1) + F(n-2) D F(n) = F(n-1) - F(n-2)
Question 2 Explanation:
None.

 Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Write a function for the Fibonacci search method.
 A public static int fibSearch(final int key, final int[] a) { int low = 0; int high = a.length - 1; int fibCurrent = public static int fibSearch(final int key, final int[] a) { int low = 0; int high = a.length - 1; int fibCurrent = public static int fibSearch(final int key, final int[] a) { int low = 0; int high = a.length - 1; int fibCurrent =  D None of the mentioned
Question 3 Explanation:
Here instead of choosing middle of the array as a point of array division, we use Fibonacci numbers, the division index are strictly between two Fibonacci numbers.

 Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What is the time complexity of Fibonacci Search?
 A O(logn) B O(n) C O(n2) D O(nlogn)
Question 4 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.

 Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What are the advantages of Fibonacci Search?
 A When the element being searched for has a non uniform access storage B Can be used in magnetic tapes C Can be used for large arrays which do not fit in the CPUcache or in the RAM D All of the mentioned