PP-T3-HL

What is recursion?

• A function that calls itself to solve a problem
• A loop that repeats a certain number of times
• A conditional statement that checks a specific condition
• A function that performs an iteration using a for loop

What is a base case in recursion?

• The condition that stops the recursion
• The initial call to a recursive function
• The part of the function that calls itself
• The final output of the recursive function

What does the recursive case in a function do?

• It calls the function itself, reducing the problem size
• It initializes the variables used in recursion
• It provides the condition to stop recursion
• It returns the final result of the recursion

Which of the following is the correct representation of the factorial of 5?

• 5 × 4 × 3 × 2 × 1
• 5 + 4 + 3 + 2 + 1
• 5! = 5 + 4 + 3 + 2 + 1
• 5 = 5 × 4 × 3 × 2 × 1

What is the Fibonacci sequence?

• A sequence where each number is the sum of the two preceding ones
• A sequence where each number is the product of the two preceding ones
• A sequence of prime numbers
• A sequence of even numbers

What is a stack overflow?

• An error due to excessive function calls without reaching a base case
• An error caused by too many variables in a function
• An error due to incorrect loop conditions
• An error caused by too many conditional statements

What is the purpose of tracing recursive calls?

• To understand how the recursive algorithm progresses and reaches the base case
• To debug loop conditions
• To initialize the variables used in recursion
• To provide the final result of the recursion

What will the following Java function return when myMethod(3) is called?

• 6
• 3
• 9
• 12

What is the base case in the following Java function?

• Both A and B
• if (n == 0)
• if (n == 1)
• return myMethod(n - 1) + myMethod(n - 2)

What will the following Java function return when myMethod(4) is called?

• 10
• 4
• 16
• 6