Title: Module 13 Quiz (Ungraded)
Course: COP 1510 Programming Concepts > Section: Module 13 - Recursion

Q: If a recursive module has no code to stop it from repeating then it is like a ________ loop.
- Iterative
- While
- Infinite
- Do-While
- Do-Until
A: Infinite

Q: A problem can be solved with recursion if it can be broken down into ________ that are identical to the overall problem.
- Successive smaller problems
- Successive smaller modules
- Smaller problems
- Smaller modules
- None of these
A: Successive smaller problems

Q: Which of the following is a mathematical game that is often used in computer science textbooks to demonstrate the power of recursion?
- Rubik's Cube
- Chess
- Blackjack
- Hangman
- The Towers of Hanoi
A: The Towers of Hanoi

Q: Which of the following can be solved with recursion?
- Finding the greatest common divisor
- Binary search
- The Fibonacci Series
- None of these
- All of these
A: All of these

Q: The choice between using recursion or a loop is primarily a ________ decision.
- Design
- Case
- Group
- Any of these
- None of these
A: Design

Q: When module A is calling module B and module B calls module A, it is called ________ recursion.
- B to A and A to B call
- A to B and B to A call
- Loop
- Indirect
- None of these
A: Indirect

Q: In the ________ case the problem is reduced to a smaller version of the original problem.
- Base
- Recursive
- Loop
- Return
- None of these
A: Recursive

Q: The first step in setting up a recursive module is to ________.
- Identify at least one case in which the problem can be solved with recursion
- Identify at least one case in which the problem can be solved without recursion
- Identify the case with the repetitive block
- Identify the case without the repetitive block
- None of these
A: Identify at least one case in which the problem can be solved without recursion

Q: The majority of repetitive programming tasks are best done with which of the following?
- Loops
- Decision structures
- Recursion
- Sequence structures
- All of these
A: Loops

Q: A ________ module is a type of module that calls itself.
- Numeric
- String
- Recursive
- Library
- None of these
A: Recursive

Q: In the following example, how many times does the module calls itself?
- 5
- 6
- 7
- 8
- 0
A: 6

Q: If a recursive module calls itself ten times, after the tenth call it returns to the ________.
- End of the module
- ninth call
- first call
- End of the program
- None of these
A: ninth call

Q: Recursion can be a powerful tool for solving ________ problems.
- Complex decision
- Repetitive
- Multiple selections
- Mathematical
- None of these
A: Repetitive

Q: The process of calling a module requires several actions to be performed by the computer and is referred to as ________.
- Overhead
- Maintenance
- memory intensive
- Inefficiency
- None of these
A: Overhead

Q: A recursive module is similar to a(n) ________ in that it must have some way to control the number of times it repeats.
- Loop structure
- Case structure
- If-Then structure
- If-Then-Else structure
- None of these
A: Loop structure

Q: True/False: The term "callback potential" refers to number of times a module calls itself.
- True
- False
A: False

Q: True/False: The Fibonacci Series is a well-known mathematical problem that is solved recursively.
- True
- False
A: True

Q: True/False: It is possible for a module to call itself.
- True
- False
A: True

Q: True/False: When creating a recursive algorithm it is optional to identify the base case and the recursive case of the algorithm.
- True
- False
A: False

Q: True/False: It is not necessary to have a conditional expression to terminate the recursive calls.
- True
- False
A: False