adplus-dvertising
frame-decoration

Question

Consider the following recursive implementation to find the factorial of a number:
Which of the following lines is the base case?
int fact(int n)
{
     if(n == 0)
        return 1;
     return n * fact(n - 1);
}
int main()
{
      int n = 5;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

a.

return 1

b.

return n * fact(n-1)

c.

if(n == 0)

d.

none of the mentioned

Answer: (c).if(n == 0)

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 recursive implementation to find the factorial of a number: Which of the following lines is the base case?

Similar Questions

Discover Related MCQs

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?

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

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

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

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

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