Question

What is the space complexity of the above recursive implementation to find the factorial of a number?

a.

O(1)

b.

O(n)

c.

O(n^2)

d.

O(n^3)

Posted under Data Structures and Algorithms

Answer: (a).O(1)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the space complexity of the above recursive implementation to find the factorial of a number?

Add Comment

Similar Questions

Discover Related MCQs

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

Q. Which of the following gives the sum of the first n natural numbers?

View solution

Q. What is the time complexity of the above iterative method used to find the sum of the first n natural numbers?

View solution

Q. What is the time complexity of the above recursive implementation used to find the sum of the first n natural numbers?

View solution

Q. Which of the following methods used to find the sum of first n natural numbers has the least time complexity?

View solution

Q. Which of the following methods can be used to find the sum of digits of a number?

View solution

Q. What can be the maximum sum of digits for a 4 digit number?

View solution

Q. What can be the minimum sum of digits for a 4 digit number?

View solution

Q. Which of the following is the binary representation of 100?

View solution

Q. What is the time complexity of the recursive implementation used to convert a decimal number to its binary equivalent?

View solution

Q. What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent?

View solution

Q. What is the time complexity of the above iterative implementation used to find the length of a linked list?

View solution

Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?

View solution

Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?

View solution

View All MCQs on Data Structures and Algorithms

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!

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...