Consider the following recursive implementation to find the nth fibonacci numbe

Sail E0 Webinar

Question

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?

Options:

A . fibo(n "“ 1)

B . fibo(n "“ 1) + fibo(n "“ 2)

C . fibo(n) + fibo(n "“ 1)

D . fibo(n "“ 2) + fibo(n "“ 1)

Answer: Option A

The line fibo(n “ 1) + fibo(n “ 2) should be inserted to complete the above code.

Was this answer helpful ?

Next Question

Submit Solution

More Questions on This Topic :

Question 1. What is the time complexity of the above iterative implementation used to find the largest and smallest element in an a....to find the largest and smallest element in an array?

Question 2. What is the space complexity of the above recursive implementation to find the factorial of a number? ....

Question 3. Which of the following lines should be inserted to complete the following recursive implementation used to find the len....len = recursive_get_len(head->next); printf("%d",len); return 0;}

Question 4. What is the output of the following code?void my_recursive_function(int n){ if(n == 0) return; printf("%....printf("%d ",n); my_recursive_function(n-1);}int main(){ my_recursive_function(10); return 0;}

Question 5. Consider the following recursive implementation used to find the length of a string:#includeint recursive_get_len(char ....following lines should be inserted to complete the above code?

Question 6. What is the output of the following code?#include#includestruct Node{ int val; struct Node* next;}*head;i.... printf("Found"); else printf("Not found"); return 0;}

Question 7. Consider the following recursive implementation of linear search:#includeint recursive_search_num(int *arr, int num, in....recursive calls should be added to complete the above code?

Question 8. What is the time complexity of the above recursive implementation of binary search? ....

Question 9. Consider the following code:#includeint recursive_sum(int n){ if(n == 0) return 0; return __....following lines is the recurrence relation for the above code?

Question 10. Consider the following recursive implementation to find the sum of digits of number:#includeint recursive_sum_of_digits....following lines should be inserted to complete the above code?

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

Pie Chart - Test Paper 1 Data Interpretation Reasoning & DI

Tabulation - Test Paper 2 Data Interpretation Reasoning & DI

Test Paper 1 Direction Sense Test Reasoning & DI

ICA , RDIC,GFM Free Modal Test Paper - Non - Technical Branch Old Syllabus 2022 - SAIL Junior Officer E0

GFM Combined 1 Free Revision Test SAIL JO E-0