MCQ Buddy
Search here...
  • Home
  • MCQ Feed
  • Add Question
  • Programming Portal
  • English Portal
  • Login
  1. Home
  2. Engineering
  3. Design and Analysis of Algorithms
  4. Question

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) f(n) = f(n) + f(n – 1)
  • (B) f(n) = f(n) + f(n + 1)
  • (C) f(n) = f(n – 1)
  • (D) f(n) = f(n – 1) + f(n – 2)
  • Correct Answer - Option(D)
  • Views: 570
  • Filed under category Design and Analysis of Algorithms
Share

Explanation by: Mr. Dubey
the relation f(n) = f(n – 1) + f(n – 2) can be used to find the nth fibonacci number.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. In LRU, the referenced blocks counter is set to’0′ and that of the previous blocks are incremented by one and others remain same, in the c

Q. Which command is used to replace ?

Q. __________are some popular OLAP tools.

Q. Which one of the below is not an component of Internet mail system

Q. Which function overloads the >> operator?

Q. What are the characteristics of a distributed file system?

Q. The rm command removes

Q. Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?

Q. The local operating system on the server machine passes the incoming packets to the

Q. Which of the following is the other name of Data mining?


Question analytics

Share

Embed

WhatsApp

Facebook

Telegram

Share in MCQ Buddy Groups

Share
Embed
Important Links
  • Browse All Categories
  • Subjects
  • Exams
  • Mock Test
  • Advance Search
  • Quiz
  • Duo Test
  • English Topics
Explore More Portals
  • Hindi
  • State wise Portals
  • MCQ Buddy Lab
  • Engineering
  • Programming Portal
  • MB Shorts
  • NCERT Portal
  • Faculties Portal
  • Groups
  • Q & A
  • Spaces
  • Satya Sanatan
  • Keycrypt
Who we are?

We are nothing if we are alone. But we have a huge community of students who are helping you getting good study stuff free.

More Links
  • Download App
  • Advertise with us
  • Contact us
  • Youtube
  • Terms & Conditions
  • Refund Policy
  • Privacy Policy

Since 2020 - 2025 | Proudly Made with ♥ in India

Hosted on Hostinger