adplus-dvertising

Welcome to the Recursion MCQs Page

Dive deep into the fascinating world of Recursion with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Recursion, a crucial aspect of Data Structures and Algorithms. In this section, you will encounter a diverse range of MCQs that cover various aspects of Recursion, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Data Structures and Algorithms.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Recursion. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Data Structures and Algorithms.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Recursion. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Recursion MCQs | Page 2 of 18

Q11.
It is necessary to declare the type of a function in the calling program if the function
Discuss
Answer: (b).Returns a non-integer value
Discuss
Answer: (b).Recursive function call
Discuss
Answer: (a).Are initialized during each execution of the function
Q14.
Predict output of following program
Consider the following recursive function fun(x, y). What is the value of fun(4, 3)
int fun(int x, int y)
{
  if (x == 0)
    return y;
  return fun(x - 1,  x + y);
}
Discuss
Answer: (a).13
Q15.
What does the following function print for n = 25?
void fun(int n)
{
  if (n == 0)
    return;
 
  printf("%d", n%2);
  fun(n/2);
Discuss
Answer: (b).10011
Q16.
________________ is a powerful technique which is used to invoke a function.
Discuss
Answer: (b).Recursion
Q17.
A function, which invokes itself repeatedly until some condition is satisfied, is called a_________.
Discuss
Answer: (a).Recursive function
Q18.
The number of recursive calls is limited to the _____ of the stack.
Discuss
Answer: (d).Size
Q19.
Two or more functions, which invoke (call) each other, are called_________________.
Discuss
Answer: (c).mutually recursive functions
Q20.
For certain problems, a recursive solution is ____________as in the case of factorial of a number.
Discuss
Answer: (c).Both (a) and (b)
Page 2 of 18

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!