# Data Structure Questions and Answers-Fibonacci Search

## Data Structure Questions and Answers-Fibonacci Search

 Question 1
Which algorithmic technique does Fibonacci search use?
 A Brute force B Divide and Conquer C Greedy Technique D Backtracking
Question 1 Explanation:
With every iteration, we divide the given array into two sub arrays(not necessarily equal).

 Question 2
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
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
What is the time complexity of Fibonacci Search?
 A O(logn) B O(n) C O(n2) D O(nlogn)