1. What is Recursion ? Junior A. a self-call that is the very last action of a routine, with nothing left to do after it returns B. a technique where a routine solves a problem by calling itself on smaller instances of the same problem C. a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack D. the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs
2. Which term means: "a technique where a routine solves a problem by calling itself on smaller instances of the same problem"? Junior A. Base case B. Recursion C. Tail call D. Recursion over loops
3. Which statement is correct? Junior A. Recursion — the terminating condition of a self-calling routine that returns a result directly without further self-calls B. Recursion — a technique where a routine solves a problem by calling itself on smaller instances of the same problem C. Recursion — the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs D. Recursion — a self-call that is the very last action of a routine, with nothing left to do after it returns
4. What is Base case ? Junior A. the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs B. the terminating condition of a self-calling routine that returns a result directly without further self-calls C. a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack D. a technique where a routine solves a problem by calling itself on smaller instances of the same problem
5. Which term means: "the terminating condition of a self-calling routine that returns a result directly without further self-calls"? Junior A. Recursion B. Recursion over loops C. Tail-call optimization D. Base case
6. Which statement is correct? Junior A. Base case — a self-call that is the very last action of a routine, with nothing left to do after it returns B. Base case — the terminating condition of a self-calling routine that returns a result directly without further self-calls C. Base case — a technique where a routine solves a problem by calling itself on smaller instances of the same problem D. Base case — the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs
7. What is Tail call ? Mid A. a technique where a routine solves a problem by calling itself on smaller instances of the same problem B. a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack C. a self-call that is the very last action of a routine, with nothing left to do after it returns D. the terminating condition of a self-calling routine that returns a result directly without further self-calls
8. Which term means: "a self-call that is the very last action of a routine, with nothing left to do after it returns"? Mid A. Base case B. Tail-call optimization C. Tail call D. Recursion
9. Which statement is correct? Mid A. Tail call — the terminating condition of a self-calling routine that returns a result directly without further self-calls B. Tail call — a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack C. Tail call — a self-call that is the very last action of a routine, with nothing left to do after it returns D. Tail call — a technique where a routine solves a problem by calling itself on smaller instances of the same problem
10. What is Tail-call optimization ? Senior A. the terminating condition of a self-calling routine that returns a result directly without further self-calls B. the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs C. a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack D. a self-call that is the very last action of a routine, with nothing left to do after it returns
11. Which term means: "a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack"? Senior A. Tail-call optimization B. Recursion C. Base case D. Tail call
12. Which statement is correct? Senior A. Tail-call optimization — a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack B. Tail-call optimization — the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs C. Tail-call optimization — a self-call that is the very last action of a routine, with nothing left to do after it returns D. Tail-call optimization — a technique where a routine solves a problem by calling itself on smaller instances of the same problem
13. What is Recursion over loops ? Mid A. a technique where a routine solves a problem by calling itself on smaller instances of the same problem B. the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs C. the terminating condition of a self-calling routine that returns a result directly without further self-calls D. a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack
14. Which term means: "the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs"? Mid A. Recursion over loops B. Recursion C. Tail-call optimization D. Tail call
15. Which statement is correct? Mid A. Recursion over loops — the terminating condition of a self-calling routine that returns a result directly without further self-calls B. Recursion over loops — a runtime technique that reuses the current stack frame for a final self-call so deep iteration does not overflow the stack C. Recursion over loops — a self-call that is the very last action of a routine, with nothing left to do after it returns D. Recursion over loops — the functional preference for self-calling definitions instead of mutable counters and explicit iteration constructs