# Recursion in Python Class 12 MCQ

Teachers and Examiners (CBSESkillEduction) collaborated to create the Recursion in Python Class 12 MCQ. All the important Information are taken from the NCERT Textbook Computer Science (083) class 12.

Contents

## Recursion in Python Class 12 MCQ

1. A function is said to be __________ if it calls itself.
a. Recursive
b. Calling function
c. Default function
d. None of the above

a. Recursive

2. There are two cases in each recursive functions – the __________ case and the ________ case.
a. Recursive case and base case
b. Default case and Recursive case
c. Base case and Default case
d. None of the above

a. Recursive case and base case

3. The _________ case is the case whose solution is pre-known and is used without computation.
a. Default case
b. Recursive case
c. Base case
d. None of the above

c. Base case

4. The ___________ case is more general case of problem, which is being solved.
a. Default case
b. Recursive case
c. Base case
d. None of the above

b. Recursive case

5. An __________ recursion is when a recursive function calls its self endlessly.
a. Default case
b. Recursive case
c. Base case
d. Infinite Recursive

d. Infinite Recursive

6. If there is no __________, or if the _________ is never executed, infinite recursion occurs.
a. Default case
b. Recursive case
c. Base case
d. Infinite Recursive

c. Base case

7. ____________ uses some memory space for each pass contrary to recursion where fresh memory is allocated for each successive call.
a. Iteration
b. Recursive case
c. Base case
d. Infinite Recursive

a. Iteration

8. ________ function are relatively slower than theier eterative counterparts.
a. Iteration
b. Recursive
c. Successive
d. None of the above

b. Recursive

9. Some commonly used recursive algorithms are _________ .
a. Factorial & GCD
b. Fibonacci Series
c. Binary Search
d. All of the above