Practice Introduction (11.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.
Define recursion in your own words.
Show hintHide hint
Think of how a problem can be divided into smaller problems.
Question 2.
What is a base case in recursion?
Show hintHide hint
Consider what happens if there’s no stopping condition.
3Question 3.
What is recursion?
- When a function calls another function.
- A function that calls itself.
- A loop that repeats indefinitely.
Show hintHide hint
Think about returning to the same function during execution.
4Question 4.
True or False: Every recursive function must have a base case.
- True
- False
Show hintHide hint
Reflect on the purposes of stopping recursion.
Question 5.
Create a recursive function to generate all permutations of a string.
Show hintHide hint
Consider how you can generate permutations by fixing one character and permuting the rest.
Question 6.
Write a recursive function that counts the number of digits in a number.
Show hintHide hint
Think about how each digit is removed by integer division.

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