adplus-dvertising
frame-decoration

Question

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)

Answer: (c).F(n) = F(n-1) + F(n-2)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Choose the recursive formula for the Fibonacci series.(n>=1)

Similar Questions

Discover Related MCQs

Q. What is the time complexity of Fibonacci Search?

Q. What are the advantages of Fibonacci Search?

Q. What is the length of the step in jump search?

Q. What is the time complexity of Jump Search?

Q. What is an in-place sorting algorithm?

Q. In the following scenarios, when will you use selection sort?

Q. What is the worst case complexity of selection sort?

Q. What is the advantage of selection sort over other sorting techniques?

Q. What is the average case complexity of selection sort?

Q. What is the disadvantage of selection sort?

Q. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,

Q. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,

Q. What is the best case complexity of selection sort?

Q. What is an external sorting algorithm?

Q. What is an internal sorting algorithm?

Q. What is the worst case complexity of bubble sort?

Q. What is the average case complexity of bubble sort?

Q. What is the advantage of bubble sort over other sorting techniques?

Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

Q. What is the best case efficiency of bubble sort in the improvised version?