Question

If an algorithm calls itself to do some part of work, it is said to be

a.

Self functioned

b.

Recursive

c.

Symmetric

d.

Self Sequenced

Posted under Recursion Data Structures and Algorithms

Answer: (b).Recursive

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If an algorithm calls itself to do some part of work, it is said to be

Add Comment

Similar Questions

Discover Related MCQs

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

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

View All MCQs on Recursion

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!

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Data Science

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

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

IT Fundamentals

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

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Digital Communication

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

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...