Question

Part of a recursive algorithm that handles a simple input that can be solved without resorting to a recursive call, is known as

a.

Base case

b.

Recursive case

c.

Summation case

d.

Relational case

Posted under Data Structures and Algorithms

Answer: (a).Base case

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Part of a recursive algorithm that handles a simple input that can be solved without resorting to a recursive call, is known as

Add Comment

Similar Questions

Discover Related MCQs

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

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

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!

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Visual Basic

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