Practice Recursion (10) - Chapter 9: Methods - ICSE Class 12 Computer Science

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 recursion?
Show hintHide hint
Think about how a function can repeat itself.
Question 2.
Give an example of a recursive method.
Show hintHide hint
Consider calculations that break down larger problems.
3Question 3.
What is a base case in recursion?
- A condition where recursion begins
- A condition where recursion stops
- A condition that does not involve recursion
Show hintHide hint
Think about what conditions stop a recursive method.
4Question 4.
True or False: Every recursive method must have both a base case and a recursive case.
- True
- False
Show hintHide hint
Consider the necessity of conditions in recursion.
Question 5.
Create a recursive method that reverses a string.
Show hintHide hint
Consider how to break down the string into smaller parts.
Question 6.
Write a recursive method to find the nth power of a number without using loops or Math.pow.
Show hintHide hint
Think about the properties of exponents.

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