adplus-dvertising
frame-decoration

Question

Consider the following code snippet.
What will happen when the above snippet is executed?
void my_recursive_function()
{
   my_recursive_function();
}
int main()
{
   my_recursive_function();
   return 0;
}

a.

The code will be executed successfully and no output will be generated

b.

The code will be executed successfully and random output will be generated

c.

The code will show a compile time error

d.

The code will run for some time and stop when the stack overflows

Answer: (d).The code will run for some time and stop when the stack overflows

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider the following code snippet. What will happen when the above snippet is executed?

Similar Questions

Discover Related MCQs

Q. Which of the following statements is true ?

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

Q. Which of the following recursive formula can be used to find the factorial of a number?

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

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

Q. Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?

Q. Which of the following is not a fibonnaci number?

Q. Which of the following methods can be used to find the nth fibonnaci number?

Q. Which of the following recurrence relations can be used to find the nth fibonacci number?

Q. What is the time complexity of the above recursive implementation to find the nth fibonacci number?

Q. What is the space complexity of the above recursive implementation to find the nth fibonacci number?

Q. Which of the following methods can be used to find the sum of first n natural numbers?

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

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

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

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

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

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

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

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