Which of the following problems can be solved using recursion? A) Towers of Hanoi B) Bubble Sort C) Linear Search D) None of the above | Card: 3 / 44 |
True or False: Recursion can only be used to solve problems that can also be solved with iterative methods. | Card: 7 / 44 |
Which type of recursion is characterized by the recursive call being the last operation performed by the function? | Card: 13 / 44 |
Fill-in-the-blanks: A stack overflow error in recursion occurs when the ______ is not defined or not reached. | Card: 15 / 44 |
True or False: Non-tailed recursion can be optimized by compilers to improve performance. | Card: 17 / 44 |
Which of the following is an example of indirect recursion? A) A function calling itself B) A function calling another function which calls the first function C) A loop D) None of the above | Card: 21 / 44 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
Fill-in-the-blanks: Recursive programs generally take more time due to the overhead of ______. | Card: 23 / 44 |
Riddle: I can traverse trees and solve the Tower of Hanoi, yet I may lead to stack overflow if I'm not careful. What am I? | Card: 27 / 44 |
True or False: Every recursive function must have a base case to ensure termination. | Card: 29 / 44 |
What is the result of calling the function fact(5) in a recursive factorial implementation? | Card: 31 / 44 |
Which of the following is NOT a type of recursion? A) Direct B) Indirect C) Tailed D) Infinite | Card: 33 / 44 |
Fill-in-the-blanks: In a tail recursive function, the recursive call is the ______ operation performed by the function. | Card: 35 / 44 |
True or False: Recursive algorithms always have better time complexity than their iterative counterparts. | Card: 39 / 44 |
What do you call recursion where a function calls itself without any intermediate function? | Card: 41 / 44 |






