Practice Direct Recursion (11.6.1) - Chapter 11: Recursion

Practise this section

10 questions

Flashcard drill
4 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
4 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 how the function knows when to stop.
Question 2.
Can you give an example of a problem that can be solved using direct recursion?
Show hintHide hint
Consider functions that can be defined in terms of smaller inputs.
3Question 3.
What is the purpose of the base case in recursion?
- To stop the recursion
- To make the function run faster
- To add complexity
Show hintHide hint
Think about what happens to the function without this condition.
4Question 4.
True or False: A function can call itself indirectly through other functions.
- True
- False
Show hintHide hint
Consider functions working in tandem instead of alone.
Question 5.
Write a recursive function that computes the nth Fibonacci number without using loops.
Show hintHide hint
Break down Fibonacci definition into smaller parts.
Question 6.
Create a recursive function to print all elements of a list in reverse order.
Show hintHide hint
Think of how you can isolate elements before reaching the base case.

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