Question
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.
4
b.
5
c.
6
d.
7
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. How many times will the function fact() be called when the following code is executed?
Similar Questions
Discover Related MCQs
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
Q. What is the time complexity of the recursive implementation used to convert a decimal number to its binary equivalent?
View solution
Q. What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent?
View solution
Q. What is the time complexity of the above iterative implementation used to find the length of a linked list?
View solution
Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?
View solution
Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?
View solution
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!
