Question

A fibonacci series is implemented using recursion
int generateFibonacci Series(int num) {
if (num <= 1)
return num;
return generateFibanacciSeries(num -1) + generateFibanacciSeries (num-2);
}

a. bottom up approach as it is calculating values each time
b. Top down approach as it is calculating values each time
c. bottom up approach as it is calculating previously completed results
d.Top down approach as it is calculating previously completed results ​

Answer 1

Gshjssjbwbwbwjsjkansna

Answer 2

A fibonacci series is implemented using recursion is

called Top down approach.

So,

Option (b) is the correct answer.

Top down approach as it is calculating values each time.