Consider The Following Iterative Implementation To Find The Nth #1627
Consider the following iterative implementation to find the nth fibonacci number?</p> <pre><code class="language-c"> int main() { int n = 10,i; if(n == 1) printf("0"); else if(n == 2) printf("1"); else { int a = 0, b = 1, c; for(i = 3; i <= n; i++) { c = a + b; ________; ________; } printf("%d",c); } return 0; }</code></pre> <p>Which of the following lines should be added 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 iterative implementation to find the nth fibonacci number?
int main() { int n = 10,i; if(n == 1) printf("0"); else if(n == 2) printf("1"); else { int a = 0, b = 1, c; for(i = 3; i <= n; i++) { c = a + b; ________; ________; } printf("%d",c); } return 0; }Which of the following lines should be added to complete the above code?
c = b b = a a = b b = c b = c a = b a = b b = aSimilar 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
