Practice Syntax Of A Recursive Function (11.5)

Practise this section

9 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
3 questions · about 2 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 a function from calling itself endlessly.
Question 2.
Write a simple recursive function to compute the power of a number, say power(base, exp).
Show hintHide hint
How do you reduce the exponent with each call?
3Question 3.
What is a base case in a recursive function?
- A case that initiates recursion
- A case that continues recursion
- A condition that halts recursion
Show hintHide hint
Remember: what keeps the recursion from running forever?
4Question 4.
True or False: Each recursive call adds a new layer to the call stack.
- True
- False
Show hintHide hint
Think about how each call relates to the previous one.
Question 5.
Write a recursive function to find the greatest common divisor (GCD) of two numbers.
Show hintHide hint
Think about how division can reduce the problem size.
Question 6.
Develop a recursive function to generate all permutations of a string.
Show hintHide hint
Consider fixing one character and applying recursion to the remaining string.

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