What is the time complexity of the recursive implementation used to fi – McqOptions

MCQOPTIONS

1.	What is the time complexity of the recursive implementation used to find the nth fibonacci term?
A.	O(1)
B.	O(n<sup>2</sup>)
C.	O(n!)
D.	Exponential
Answer» D. Exponential

Discussion

No Comment Found

Related MCQs

What is the space complexity of the following dynamic programming implementation used to compute the nth fibonacci term?
What is the time complexity of the following dynamic programming implementation used to compute the nth fibonacci term?
Consider the following code to find the nth fibonacci term using dynamic programming: Which technique is used by line 7 of the above code?
Consider the following code to find the nth fibonacci term using dynamic programming: Which property is shown by line 7 of the above code?
What will be the output when the following code is executed?
What is the space complexity of the following for loop method used to compute the nth fibonacci term?
What is the time complexity of the following for loop method used to compute the nth fibonacci term?
Suppose we find the 8th term using the recursive implementation. The arguments passed to the function calls will be as follows: Which property is shown by the above function calls?
Consider the recursive implementation to find the nth fibonacci number: Which line would make the implementation complete?
The following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21,…..Which technique can be used to get the nth fibonacci term?