Practice Stack Overflow (11.10.3) - Chapter 11: Recursion

Practise this section

10 questions

Flashcard drill
3 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 a base case in recursion?
Show hintHide hint
Think about what prevents infinite loops.
Question 2.
What happens if you ignore the base case?
Show hintHide hint
Consider what happens if a function keeps calling itself endlessly.
3Question 3.
What is recursion?
- A method of sorting
- A function calling itself
- An error type
Show hintHide hint
Consider how a function's definition involves its use.
4Question 4.
True or False: Every recursive function must have both base and recursive cases.
- True
- False
Show hintHide hint
Think about what happens without either case.
Question 5.
Write a recursive function that checks if a given string is a palindrome.
Show hintHide hint
Think of how to compare characters from the ends towards the middle.
Question 6.
Demonstrate how to generate all permutations of a list using recursion.
Show hintHide hint
Consider fixing a single element and permuting the rest.

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