Test by Bikram | Mock GATE | Test 1 | Question: 45

Question

How many times $fibon$$\left ( 3 \right )$ is called during invocation of $fibon$ $\left ( 6 \right )$?

$fibon(x) = fibon(x-1) + fibon(x-2)$
$fibon(0) = 1$
$fibon(1) = 1$

• A. 3
• B. 4
• C. 5
• D. 6

Answer 1

Make recursion tree for better understanding

Comments

sir how 6 ????

---

My answer is 6. But it is still showing correct answer as 3. Please rectify the mistake in paper.