Question

What is the output of the following code?

void my_recursive_function(int n)
{
    if(n == 0)
    return;
    printf("%d ",n);
    my_recursive_function(n-1);
}
int main()
{
    my_recursive_function(10);
    return 0;
}

a.

10

b.

1

c.

10 9 8 … 1 0

d.

10 9 8 … 1

Posted under Recursion Data Structures and Algorithms

Answer: (d).10 9 8 … 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 output of the following code?

Add Comment

Similar Questions

Discover Related MCQs

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

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

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!

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Visual Basic

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

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

C Programming

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

Compiler Design

Unravel the process of translating source code into executable programs with our...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...