Chapter 13, Problem 1MC

Program Description Answer

A recursive function can call itself.

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:
  • 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. So, 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:

Calls a different module:

A recursive function cannot call the different function.

Hence, the option “A” is wrong.

Abnormally halts the program:

A recursive function cannot halt the program.

Hence, the option “B” is wrong.

Can be called only once:

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

Hence, the option “D” is wrong.