Chapter 12, Problem 1MC

Program Description Answer

A function which calls itself is called as recursion.

Hence, the correct answer is option “C”.

Explanation of Solution

Recursion:

Recursion is a process where function is called again and again by itself for a specific number of times.

• There are two types of recursive functions. They are as follows:
  • Direct recursion
  • Indirect recursion

Direct recursion:

When a function calls the same function repeatedly until the condition becomes false, then it is called as direct recursion.

Indirect recursion:

When a function calls another function which in turn calls the same calling function, then it is called as indirect recursion.

Example:

Consider the following example; the function “Add()” can be called itself in the same function definition. Hence, it comes under direct recursion.

#Define the Add()function

def Add()

         #Print the message

         print('Example of recursive function!!')

         #Call the Add() function recursively

         Add()

Explanation for wrong options:

A recursive function cannot call the different function.

Hence, option “A” is wrong.

A recursive function cannot halt the program.

Hence, option “B” is wrong.

A recursive function can call more than once in a program.

Hence, option “D” is wrong.