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)

Posted under Data Structures and Algorithms

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

Similar Questions

Discover Related MCQs

Q. What is the time complexity of Fibonacci Search?

View solution

Q. What are the advantages of Fibonacci Search?

View solution

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

View solution

Q. What is the time complexity of Jump Search?

View solution

Q. What is an in-place sorting algorithm?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. What is the disadvantage of selection sort?

View solution

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

View solution

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,

View solution

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

View solution

Q. What is an external sorting algorithm?

View solution

Q. What is an internal sorting algorithm?

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

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

View solution
View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...