Fundamental Programming — Test 3

Correct Answer: A. Nothing about inlining; it is only a hint, though it does permit multiple identical definitions across translation units
Explanation: Compilers may ignore the hint. Today the main effect of inline is relaxing the one-definition rule.

Correct Answer: A. tuple
Explanation: *args collects extra positional arguments into a tuple. **kwargs collects keyword arguments into a dict.

Correct Answer: B. f(1, b=2)
Explanation: Parameters after a bare * are keyword-only, so b must be passed by name.

Correct Answer: A. Only a pointer to the first element is passed, so the function can modify the original array
Explanation: Array parameters decay to pointers. That is why sizeof(arr) inside the function gives the pointer's size.

Correct Answer: A. 10
Explanation: f(4) = 4 + 3 + 2 + 1 + 0 = 10.

Correct Answer: A. RecursionError (maximum recursion depth exceeded)
Explanation: Each call adds a stack frame. CPython stops at its recursion limit, which defaults to about 1000.

Correct Answer: B. No; tail calls still consume stack frames
Explanation: Python intentionally omits TCO to keep tracebacks complete. Scala has @tailrec; Python does not.

Correct Answer: B. 123
Explanation: The print comes after the recursive call, so output happens as the calls unwind: 1, 2, 3. ALSO KNOW (related points): • Given int f(int n){ return n == 0 ? 0 : n + f(n-1); }, what is f(4)? → 10

Correct Answer: C. Exponential, O(2^n)
Explanation: The same subproblems are recomputed many times. Memoization reduces the cost to O(n). ALSO KNOW (related points): • What happens when a recursive Python function has no reachable base case? → RecursionError (maximum recursion depth exceeded) • Does CPython optimize tail-recursive calls (tail-call optimization)? → No; tail calls still consume stack frames • Which statement about recursion compared with iteration is correct? → Any recursive algorithm can be rewritten iteratively, typically by using an explicit stack

Correct Answer: C. Any recursive algorithm can be rewritten iteratively, typically by using an explicit stack
Explanation: Recursion and iteration are equally expressive. Recursion usually uses more memory because of the call stack.