Virtual Labs

Comparison of Fibonacci Series Generation Using Iterative and Recursive Methods

In the recursive visualization of fib(5), why do multiple nodes with the same label (e.g., f(2)) appear?

a: Because Fibonacci numbers repeat in the sequence Explanation

Explanation

b: Because the visualization duplicates nodes for clarity Explanation

Explanation

c: Because f(2) is a base case Explanation

Explanation

d: Because the recursive function recomputes the same subproblems Explanation

Explanation

When stepping through the recursive simulation, why does the call stack grow before any values are returned?

a: Because recursion must reach base cases before returning Explanation

Explanation

b: Because return statements execute first Explanation

Explanation

c: Because Fibonacci values are stored later Explanation

Explanation

d: Because the compiler delays execution Explanation

Explanation

In the iterative Fibonacci simulation, how does the execution flow differ from the recursive version?

a: It branches into two paths at each step Explanation

Explanation

b: It repeatedly calls the same function Explanation

Explanation

c: It uses a single linear sequence of updates Explanation

Explanation

d: It creates a call tree internally Explanation

Explanation

Based on the simulation, which visualization shows a call tree structure?

a: Both recursive and iterative Explanation

Explanation

b: Only iterative Explanation

Explanation

c: Neither Explanation

Explanation

d: Only recursive Explanation

Explanation

Why does the total number of calls grow rapidly in the recursive simulation as n increases?

a: The stack size grows exponentially Explanation

Explanation

b: Each function call creates two new calls except at base cases Explanation

Explanation

c: The loop runs many times Explanation

Explanation

d: The visualization exaggerates execution Explanation

Explanation

When comparing both simulations, which approach uses constant extra memory?

a: Recursive Explanation

Explanation

b: Both Explanation

Explanation

c: Depends on input size Explanation

Explanation

d: Iterative Explanation

Explanation

While observing both modes, why does the iterative simulation complete with far fewer steps?

a: Because it avoids repeated computations Explanation

Explanation

b: Because it skips base cases Explanation

Explanation

c: Because it uses recursion internally Explanation

Explanation

d: Because it returns values earlier Explanation

Explanation

If memoization were added to the recursive simulation, how would it compare visually to the iterative version?

a: It would still show a full branching tree Explanation

Explanation

b: It would become deeper Explanation

Explanation

c: It would look closer to a linear flow Explanation

Explanation

d: It would remove base cases Explanation

Explanation

After using both simulations, which statement best summarizes the trade-off?

a: Recursive is faster and simpler Explanation

Explanation

b: Recursive is intuitive but inefficient, iterative is efficient but less visual Explanation

Explanation

c: Both approaches behave the same Explanation

Explanation

d: Iterative is faster but harder to understand Explanation

Explanation