Fibonacci using Dynamic Programming MCQ

Test your knowledge with important Fibonacci using Dynamic Programming MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Fibonacci using Dynamic Programming MCQs at Bissoy

• What is the space complexity of the recursive implementation used to find the nth fibonacci term?
  ক

  O(1)

  খ

  O(n)

  গ

  O(n2)

  ঘ

  O(n3)
• What is the time complexity of the recursive implementation used to find the nth fibonacci term?
  ক

  O(1)

  খ

  O(n2)

  গ

  O(n!)

  ঘ

  Exponential
• 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?
  ক

  Recursion

  খ

  Dynamic programming

  গ

  A single for loop

  ঘ

  Recursion, Dynamic Programming, For loops