Chapter 12 Recursion

Question 1

A recursive function must have some way to control the number of times it repeats.
True or False?

Answer 1

True

Chapter 1 2Q

Question 2

Which of the following describes the base case in a recursive solution?

a. the case in which the problem is solved through recursion
b. a case in which the problem can be solved without recursion
c. the way to return the main function
d. the way to stop the recursion

Answer 2

a case in which the problem can be solved without recursion

Question 3

Each time a function is called in a recursive solution, the system incurs overhead that is not incurred with a loop.
True or False?

Answer 3

True

Question 4

Recursive algorithms are always more concise and efficient than iterative algorithms.
True or False

Answer 4

False