Question
a.
Recursive functions tend to declare many local variables
b.
Previous function calls are still open when the function calls itself and the activation records of these previous calls still occupy space on the call stack
c.
Many copies of the function code are created
d.
It requires large data values
Posted under Recursion Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Recursion is memory-intensive because:
Similar Questions
Discover Related MCQs
Q. Part of a recursive algorithm that handles a simple input that can be solved without resorting to a recursive call, is known as
View solution
Q. A recursive agorithm must have
View solution
Q. If an algorithm calls itself to do some part of work, it is said to be
View solution
Q. For which of the following cases will the reversal of a string be equal to the original string?
View solution
Q. Recursion is a method in which the solution of a problem depends on ____________
View solution
Q. Which of the following problems can be solved using recursion?
View solution
Q. Recursion is similar to which of the following?
View solution
Q. In recursion, the condition for which the function will stop calling itself is ____________
View solution
Q. Which of the following statements is true ?
View solution
Q. Which of the following methods can be used to find the factorial of a number?
View solution
Q. Which of the following recursive formula can be used to find the factorial of a number?
View solution
Q. What is the time complexity of the above recursive implementation to find the factorial of a number?
View solution
Q. What is the space complexity of the above recursive implementation to find the factorial of a number?
View solution
Q. Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?
View solution
Q. Which of the following is not a fibonnaci number?
View solution
Q. Which of the following methods can be used to find the nth fibonnaci number?
View solution
Q. Which of the following recurrence relations can be used to find the nth fibonacci number?
View solution
Q. What is the time complexity of the above recursive implementation to find the nth fibonacci number?
View solution
Q. What is the space complexity of the above recursive implementation to find the nth fibonacci number?
View solution
Q. Which of the following methods can be used to find the sum of first n natural numbers?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
