What is tail recursion? - Vidyadip

MCQ

What is tail recursion?

A
A recursive function that has two base cases
B
A function where the recursive functions leads to an infinite loop
C
A recursive function where the function doesn't return anything and just prints the values
✓
A function where the recursive call is the last thing executed by the function

✓

Answer

Correct option: D.

A function where the recursive call is the last thing executed by the function

(d) Explanation: A recursive function is tail recursive when recursive call is executed by the function in the last.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "M.C.Q" from Idea of Efficiency and Recursion→Idea of Efficiency and Recursion — all question types→Computer Science STD 12 Science question papers→CBSE Board STD 12 Science question papers→CBSE Board question paper generator→

Similar questions

__________ is not a network device.

Which function is used to access the vertical subset of the data frame:

Which of the following library is similar to Pandas?

IDLE full form is:

How can we get the number of records or rows in a table?

Which SQL statement is used to return only different values?

Floor division can be done using:

A Table customer contains 5 rows and 7 columns. What will be its cardinality and degree?

Number of rows in a relation is known as

The malicious program used for tracking and recording the user's keystroke