

MCQOPTIONS
Saved Bookmarks
1. |
Choose the recursive formula for the Fibonacci series.(n>=1) |
A. | F(n) = F(n+1) + F(n+2) |
B. | F(n) = F(n) + F(n+1) |
C. | F(n) = F(n-1) + F(n-2) |
D. | F(n) = F(n-1) F(n-2) |
Answer» D. F(n) = F(n-1) F(n-2) | |