## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Fibonacci Search

Question 1 |

Which algorithmic technique does Fibonacci search use?

Brute force | |

Divide and Conquer | |

Greedy Technique | |

Backtracking |

**Puzzles Questions answers**

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)

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) |

**Visual arts Questions answers**

Question 2 Explanation:

None.

Question 3 |

Write a function for the Fibonacci search method.

public static int fibSearch(final int key, final int[] a) { int low = 0; int high = a.length - 1; int fibCurrent = | |

None of the mentioned |

**Current affairs Questions answers**

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?

O(logn) | |

O(n) | |

O(n ^{2}) | |

O(nlogn) |

**Puzzles Questions answers**

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 |

What are the advantages 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 CPUcache or in the RAM | |

All of the mentioned |

**ICT Questions answers**

Question 5 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.

There are 5 questions to complete.