Practice Sample Problem and Solution - 11.12 | Chapter 11: Recursion | ICSE Class 12 Computer Science
K12 Students

Academics

AI-Powered learning for Grades 8–12, aligned with major Indian and international curricula.

Professionals

Professional Courses

Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.

Games

Interactive Games

Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.

Practice Questions

Test your understanding with targeted questions related to the topic.

Question 1

Easy

What is the base case for the sum of digits function?

💡 Hint: Think about what happens when there are no digits left.

Question 2

Easy

How can we get the last digit of a number?

💡 Hint: What operation gives you the remainder?

Practice 4 more questions and get performance evaluation

Interactive Quizzes

Engage in quick quizzes to reinforce what you've learned and check your comprehension.

Question 1

What is the correct base case for finding the sum of digits?

  • Return 0
  • Return 1
  • Return n

💡 Hint: What condition signifies the end of recursion?

Question 2

Recursion can potentially lead to what error?

  • True
  • False

💡 Hint: What happens when the call stack is overused?

Solve 1 more question and get performance evaluation

Challenge Problems

Push your limits with challenges.

Question 1

Modify the sum_of_digits function to return the product of the digits instead of the sum.

💡 Hint: Think about how you would change the operator.

Question 2

Create a new recursive function that counts how many digits are in a given number.

💡 Hint: Consider what defines the count of a number.

Challenge and get performance evaluation