What is the primary purpose of a base case in a recursive function?
2 Recursion Online Quiz Questions
Use this free practice quiz with 20 questions to review 2 Recursion, test your knowledge, and prepare for your next test or exam.
Using the recursive definition of factorial in the material, what value does factorial(4) return?
- A
4
- B
16
- C
24
- D
120
A recursive binary search makes one call on approximately half the input and performs constant additional work. What is its running time?
- A
O(1)
- B
O(logn)
- C
O(n)
- D
O(nlogn)
Which steps are part of a sound process for designing a recursive solution? Select all that apply.
- A
Define precisely what the subproblem should return
- B
Ensure every recursive call moves closer to a base case
- C
Increase the problem size at each recursive call
- D
Combine the recursive result with the current computation
- E
Ignore the cost of calls and call-stack depth
In which situations is recursion often a clear or natural choice? Select all that apply.
- A
Processing a tree structure
- B
A divide-and-conquer algorithm
- C
A backtracking search with branching choices
- D
A simple loop whose input may be extremely large
- E
A situation where stack space is severely limited
Recursive function calls are removed from the call stack in last-in, first-out order.
- A
True
- B
False
Python generally replaces a tail-recursive function's current stack frame instead of adding a new one.
- A
True
- B
False
For the material's correct countdown(n) function called as countdown(4), how many numbers are printed before the base case is reached?
The condition for which a recursive function's answer is known directly is its .
The maximum number of simultaneously active stack frames during a recursive computation is called .
Explain how mathematical induction can establish the correctness of the recursive factorial function for every nonnegative integer.
A preorder traversal recursively visits the root and then the left and right subtrees. For a binary tree with n nodes, what is its running time?
- A
O(logn)
- B
O(n2)
- C
O(n)
- D
O(2n)
In the recursive function sum_from(a, i), which condition serves as the base case for summing the elements from index i through the end of the array?
- A
i == len(a) - B
i == 0for every input - C
a[i] == 0 - D
iis increased by 2
Given the recursive function countdown(n) that prints returning n after calling countdown(n - 1), what sequence is printed after calling countdown(3) reaches its base case?
- A
returning 3,returning 2,returning 1 - B
returning 1,returning 2,returning 3 - C
returning 0,returning 1,returning 2 - D
No returning messages are printed
A merge sort implementation recursively sorts two halves of an array and then merges the halves in linear time. What is the resulting asymptotic running time?
- A
O(logn)
- B
O(n)
- C
O(n2)
- D
O(nlogn)
The naive recursive Fibonacci function makes repeated calls for the same inputs. Which change described in the material reduces its running time to O(n)?
- A
Store previously computed results with memoization
- B
Remove both recursive calls and return 0
- C
Increase the recursion depth limit
- D
Make each recursive call use the same argument
True or false: In Python, making a recursive call the final operation of a function generally prevents additional stack frames from accumulating.
- A
True
- B
False
Using the recursive definition of factorial in the material, what value does factorial(5) return?
What proof method establishes recursive algorithm correctness by proving a base case and then showing that correctness for smaller inputs implies correctness for the current input?
Consider a linked-list function that returns 0 for an empty node and otherwise returns 1 + length(node.next). What recursion pattern does this function use?
Related study packs and tools
02 — Information and Representation
A progressive guide to how computers encode numbers, text, images, and sound as binary data, including the trade-offs and limits of digital representation.
03 — Python Programming Fundamentals
A focused set of flashcards covering Python variables, data types, expressions, control flow, functions, input, output, and common programming practices.
04 Conditionals and Boolean Logic
Learn how Boolean expressions, logical operators, and conditional structures let programs make reliable decisions, including how to handle boundaries, branch order, and testing.
05 — Data Structures: Concepts, Operations, and Trade-Offs
A structured guide to the main data structures, their operations, efficiency trade-offs, representations, and practical selection criteria.
07 Trees and Binary Search Trees
A progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
10 — Data, Systems, and Applications
A progression through how data is organized, searched, exposed through software interfaces, and managed through abstraction layers in modern computer systems.
12 — Foundations Capstone
A medium-difficulty quiz on integrating problem definition, representation, algorithms, complexity analysis, testing, correctness, ethical evaluation, and documentation in a computer science capstone.
12 — Foundations Capstone: Integrating Computer Science
A practical guide to integrating problem definition, data representation, modular programming, algorithms, complexity analysis, testing, correctness, and ethical evaluation into a responsible computer science capstone.
OS Processes
This quiz covers process management, context switching and scheduling, multitasking, traps and interrupts, and RISC-V privilege transitions.