Practice Direct Recursion (12.3.1) - Recursion - ICSE 11 Computer Applications

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 direct recursion?
Show hintHide hint
Think about functions that refer to themselves.
Question 2.
What is a base case in recursion?
Show hintHide hint
What makes recursion stop?
3Question 3.
What does a base case do in recursion?
- Stops recursion
- Initiates recursion
- Changes the function
- None of the above
Show hintHide hint
Remember the definition of the base case.
4Question 4.
Direct recursion involves a function calling itself directly.
- True
- False
Show hintHide hint
Think about what 'direct' means in this context.
Question 5.
Design a recursive function to compute the nth Fibonacci number. Explain how it leverages direct recursion.
Show hintHide hint
Break down Fibonacci into definitions of previous numbers.
Question 6.
Consider the factorial function. Optimize it using memoization: how would that change the recursive approach?
Show hintHide hint
Think about storing results to avoid recalculating them.

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