Consider The Following Recursive Implementation To Find The Nth #1629
Consider the following recursive implementation to find the nth fibonacci number:</p> <pre><code class="language-c"> int fibo(int n) { if(n == 1) return 0; else if(n == 2) return 1; return ________; } int main() { int n = 5; int ans = fibo(n); printf("%d",ans); return 0; }</code></pre> <p>Which of the following lines should be inserted to complete the above code?
This multiple choice question (MCQ) is related to the book/course
gs gs122 Data Communication and Computer Network.
It can also be found in
gs gs122 Recursion - Fibonacci using Recursion - Quiz No.1.
Consider the following recursive implementation to find the nth fibonacci number:
int fibo(int n) { if(n == 1) return 0; else if(n == 2) return 1; return ________; } int main() { int n = 5; int ans = fibo(n); printf("%d",ans); return 0; }Which of the following lines should be inserted to complete the above code?
fibo(n - 1)
fibo(n - 1) + fibo(n - 2)
fibo(n) + fibo(n - 1)
fibo(n - 2) + fibo(n - 1)
Similar question(s) are as followings:
Online Quizzes of gs122 Data Communication and Computer Network
Sorting - Insertion Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - Insertion Sort - Quiz No.2
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - Insertion Sort - Quiz No.3
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - LSD Radix Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - MSD Radix Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - MSD Radix Sort - Quiz No.2
gs gs122 Data Communication and Computer Network
Online Quizzes
