Fibonacci Numbers Quiz

Which Java data type should be used to store large Fibonacci numbers to avoid overflow?

• int

• long

• double

• BigInteger

In the context of Fibonacci numbers, what is memoization used for?

• Encrypting data

• Avoiding stack overflow errors

• Storing intermediate results to avoid redundant computations

• Reversing a sequence

What is the primary disadvantage of using the naive recursive approach to compute Fibonacci numbers?

• It requires extensive memory usage.

• It is difficult to implement.

• It has exponential time complexity.

• It cannot compute Fibonacci numbers accurately.

Which of the following is an example of a Fibonacci sequence-related problem?

• Finding the largest element in an array

• Sorting a list of integers

• Computing the sum of prime numbers

• Counting ways to reach the nth step using 1 or 2 steps at a time

What is the Fibonacci sequence term following 21?

• 34

• 55

• 89

• 144

What will be the output of fibonacci(6)?

• 5

• 6

• 8

• 13

Which of the following is the correct base case for computing Fibonacci numbers recursively?

• fib(0) = 1, fib(1) = 1

• fib(0) = 0, fib(1) = 1

• fib(0) = 1, fib(1) = 2

• fib(0) = 0, fib(1) = 0

What is the time complexity of the iterative dynamic programming approach to compute Fibonacci numbers?

• O(n)

• O(log n)

• O(2^n)

• O(n^2)

Which data structure can be used to implement memoization for efficient Fibonacci computation?

• Array

• Linked List

• Queue

• Stack

Which mathematical concept can be used to derive a closed-form expression for Fibonacci numbers, providing a direct formula for computing any term in the sequence?

• Exponential function

• Geometric sequence

• Golden ratio

• Taylor series