Home / MCQ Bank / Computer
Computer Miscellaneous On Data Structures Difficulty: Medium

Consider the following recursive implementation to find the nth fibonnaci number: int fibo(int n) { if(n == 1) return 0; else if(n == 2) return 1; return fibo(n - 1) + fibo(n - 2); } int main() { int n = 5; int ans = fibo(n); printf("%d",ans); return 0; } Which of the following is the base case?

Select the correct option to test your answer:

More Computer Questions

. . . . . . . . is used when you have variables that form rows instead of columns. What will be the output of the following C code? #include <stdio.h> void main() { #define max 37 printf("%d", max); } Among the keywords below, which one is not a statement? One of the special feature of an interpreter in reference with the for loop is that 'W'h'i'c'h' 'o'f' 't'h'e' 'f'o'l'l'o'w'i'n'g' 'c'h'a'n'g'e's' 'o'r'd'e'r' 'o'f' 't'h'e' 'g'r'i'd' 'c'o'l'u'm'n's'?'