Fibonacci Using Recursion in DSA C# - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to return the base case value for n equals 0.

DSA C#

if (n == 0) return [1];

Drag options to blanks, or click blank then click option'

An

B1

C0

D-1

Attempts:

3 left

💡 Hint

Common Mistakes

Returning 1 instead of 0 for n equals 0.

Returning n directly without checking base case.

The Fibonacci sequence starts with 0 at position 0, so the function should return 0 when n is 0.

2fill in blank

medium

Complete the code to return the base case value for n equals 1.

DSA C#

if (n == 1) return [1];

Drag options to blanks, or click blank then click option'

A1

B0

Cn

D-1

Attempts:

3 left

💡 Hint

Common Mistakes

Returning 0 instead of 1 for n equals 1.

Returning n directly without checking base case.

The Fibonacci sequence has 1 at position 1, so the function should return 1 when n is 1.

3fill in blank

hard

Fix the error in the recursive call to calculate Fibonacci for n-1.

DSA C#

return Fibonacci([1]) + Fibonacci(n - 2);

Drag options to blanks, or click blank then click option'

An - 1

Bn + 1

Cn - 3

D1

Attempts:

3 left

💡 Hint

Common Mistakes

Using n + 1 which causes infinite recursion.

Using n - 3 which skips necessary calculations.

The Fibonacci number at position n is the sum of Fibonacci numbers at positions n-1 and n-2, so the first recursive call must be Fibonacci(n - 1).

4fill in blank

hard

Fill both blanks to complete the recursive Fibonacci function correctly.

DSA C#

if (n == [1]) return 0;
if (n == [2]) return 1;

Drag options to blanks, or click blank then click option'

A0

B1

C2

Dn

Attempts:

3 left

💡 Hint

Common Mistakes

Swapping the base cases or using wrong numbers.

Using n or 2 as base cases incorrectly.

The base cases for Fibonacci are n == 0 returning 0, and n == 1 returning 1.

5fill in blank

hard

Fill all three blanks to complete the recursive Fibonacci function with correct base cases and recursive calls.

DSA C#

if (n == [1]) return 0;
if (n == [2]) return 1;
return Fibonacci(n [3]) + Fibonacci(n - 2);

Drag options to blanks, or click blank then click option'

A0

B1

C- 1

D+ 1

Attempts:

3 left

💡 Hint

Common Mistakes

Using +1 instead of -1 in the recursive call.

Mixing up base case values.

The function returns 0 when n is 0, 1 when n is 1, and for other n it returns Fibonacci(n-1) + Fibonacci(n-2).

Practice

1. What does the Fibonacci sequence represent when calculated using recursion?

easy

A. Each number is the product of the two preceding numbers

B. Each number is the sum of the two preceding numbers

C. Each number is the difference of the two preceding numbers

D. Each number is the division of the two preceding numbers

Solution

1. Step 1: Understand Fibonacci sequence definition

   The Fibonacci sequence is defined such that each number is the sum of the two numbers before it.

2. Step 2: Apply to recursion context

   Recursion calculates this by calling the function for the two previous numbers and adding their results.

3. Final Answer:

   Each number is the sum of the two preceding numbers -> Option B

4. Quick Check:

   Fibonacci = sum of two previous numbers [OK]

Hint: Remember Fibonacci adds two previous numbers [OK]

Common Mistakes:

• Thinking Fibonacci multiplies previous numbers
• Confusing subtraction or division with addition
• Assuming Fibonacci uses only one previous number

2. Which of the following is the correct C# syntax to define a recursive Fibonacci function header?

easy

A. void Fibonacci(int n)

B. int Fibonacci()

C. int Fibonacci(int n)

D. int Fibonacci(int)

Solution

1. Step 1: Identify function return type and parameters

   The Fibonacci function returns an integer and takes an integer parameter for the position.

2. Step 2: Match correct C# syntax

   Correct syntax includes return type, function name, and parameter with type: int Fibonacci(int n)

3. Final Answer:

   int Fibonacci(int n) -> Option C

4. Quick Check:

   Function returns int and takes int parameter [OK]

Hint: Function must return int and take int parameter [OK]

Common Mistakes:

• Using void return type instead of int
• Missing parameter type or name
• Incorrect parameter list syntax

3. What is the output of this C# code snippet?

static int Fibonacci(int n) {
  if (n <= 1) return n;
  return Fibonacci(n - 1) + Fibonacci(n - 2);
}

Console.WriteLine(Fibonacci(4));

medium

A. 3

B. 5

C. 4

D. 7

Solution

1. Step 1: Calculate Fibonacci(4) using recursion

   Fibonacci(4) = Fibonacci(3) + Fibonacci(2). Fibonacci(3) = Fibonacci(2) + Fibonacci(1) = 1 + 1 = 2. Fibonacci(2) = Fibonacci(1) + Fibonacci(0) = 1 + 0 = 1. So Fibonacci(4) = 2 + 1 = 3.

2. Step 2: Confirm output

   The printed output is 3.

3. Final Answer:

   3 -> Option A

4. Quick Check:

   Fibonacci(4) = 3 [OK]

Hint: Trace calls down to base cases to sum results [OK]

Common Mistakes:

• Confusing Fibonacci(4) with Fibonacci(5)
• Miscounting base cases
• Adding wrong recursive results

4. Identify the error in this recursive Fibonacci function:

int Fibonacci(int n) {
  if (n == 0) return 0;
  if (n == 1) return 1;
  return Fibonacci(n - 1) - Fibonacci(n - 2);
}

medium

A. The recursive call uses subtraction instead of addition

B. Parameter type is missing

C. Function lacks return type

D. Base cases are incorrect

Solution

1. Step 1: Check base cases

   Base cases for n=0 and n=1 are correct and return 0 and 1 respectively.

2. Step 2: Analyze recursive return statement

   The function uses subtraction (Fibonacci(n - 1) - Fibonacci(n - 2)) instead of addition, which is incorrect for Fibonacci sequence.

3. Final Answer:

   The recursive call uses subtraction instead of addition -> Option A

4. Quick Check:

   Fibonacci sums previous two, not subtracts [OK]

Hint: Fibonacci adds two previous calls, not subtracts [OK]

Common Mistakes:

• Using subtraction instead of addition in recursion
• Forgetting to return in base cases
• Missing parameter or return type in function

5. How can you optimize the recursive Fibonacci function to avoid repeated calculations?

hard

A. Increase the recursion depth limit

B. Replace recursion with a while loop only

C. Use subtraction instead of addition in recursion

D. Use memoization to store and reuse computed values

Solution

1. Step 1: Understand problem with naive recursion

   Naive recursion recalculates Fibonacci values many times, causing inefficiency.

2. Step 2: Apply memoization technique

   Memoization stores results of Fibonacci calls in a cache to reuse, avoiding repeated work.

3. Final Answer:

   Use memoization to store and reuse computed values -> Option D

4. Quick Check:

   Memoization optimizes recursion by caching results [OK]

Hint: Cache results to avoid repeated recursive calls [OK]

Common Mistakes:

• Thinking only loops can optimize recursion
• Increasing recursion depth does not improve efficiency
• Using subtraction breaks Fibonacci logic