Practice How Recursion Works (11.4) - Chapter 11: Recursion

Practise this section

11 questions

Flashcard drill
5 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
5 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the base case in a recursive function?
Show hintHide hint
Think about what would happen if there were no stopping condition.
Question 2.
Provide an example of direct recursion.
Show hintHide hint
Recall the definition of direct recursion.
3Question 3.
What is the purpose of a base case in recursion?
- To prevent infinite loops
- To always return a value
- To create an error
Show hintHide hint
Think about why we want to stop a function from calling itself forever.
4Question 4.
Can recursion lead to stack overflow?
- True
- False
Show hintHide hint
This can happen if the base case is not properly defined.
Question 5.
Create a recursive function that reverses a string. Provide the implementation.
Show hintHide hint
Think about how you can break the string down.
Question 6.
Design a recursive function to find the greatest common divisor (GCD) of two numbers.
Show hintHide hint
Use the properties of GCD to divide the problem.

7 more questions in this section. Enroll free to practise them all.