Design and Analysis of Algorithms MCQ: Which of the following recurrence relations can be used to find the nth fibonacci number?

← All Design and Analysis of Algorithms questions

Which of the following recurrence relations can be used to find the nth fibonacci number?

Correct Answer: f(n) = f(n – 1) + f(n – 2)

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Design and Analysis of Algorithms MCQs All Engineering topics Mock test hub