The following sequence is a fibonacci sequence0 1 1 2 3 5 8 13 21 ..

Explore topic-wise MCQs in Data Structure.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.

1.	The following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21, ..
A.	nWhich technique can be used to get the nth fibonacci term?
B.	Recursion
C.	Dynamic programming
D.	A single for loop
E.	Recursion, Dynamic Programming, For loops
Answer» E. Recursion, Dynamic Programming, For loops

Discussion

Explore topic-wise MCQs in Data Structure.

The following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21, ..