Deck 9: Recursion

Question 1

Like a loop, a recursive method must have a way to control the number of times it ___________________.

Answer 1

repeats

Question 2

The number of times a method calls itself is known as the:

A) depth of recursion
B) depth of repetition
C) length of recursion
D) number of repetitions
E) None of these

Answer 2

A

Question 3

Recursion can be a powerful tool for solving repetitive problems.

Answer 3

True

Question 4

What is the term for the aspect of a problem that is reduced to a smaller version of the original problem?

A) base case
B) ending case
C) final case
D) recursive case
E) None of these

Question 5

Any problem that can be solved with recursion can also be solved with a loop.

Question 6

A problem can be solved with recursion if

A) it can be broken down into any set of smaller problems
B) it can be broken down into at least three different subparts
C) it can be broken down into successive smaller problems that are identical to the overall problem
D) it can be solved by any method
E) None of these

Question 7

The base case is the aspect of a problem that can be solved without recursion.

Question 8

A recursive method is a method that calls itself.

Question 9

A(n) ___________________ method is a method that calls itself.

Question 10

Any mathematical problem can be solved with recursion.

Question 11

The number of times a method calls itself is known as the depth of iteration.

Question 12

Like a loop, a recursive method must have some way to control the number of times it repeats.

Question 13

Which of the following would be a base case for a summation algorithm (the sum of the numbers from 0 to n)?

A) If n = 0 then summation(n) = 0
B) if n > 0 then summation(n) = 5
C) If n > 0 then summation(n) = getValue(n)
D) If n > 0 then summation(n) = n + summation(n-1)
E) None of these

Question 14

What is the term for the aspect of a recursive problem that can be solved without recursion?

A) base case
B) ending case
C) final case
D) recursive case
E) None of these

Question 15

The recursive case of a problem is solved without recursion.

Question 16

When a recursive method ends, control of the program returns to the point:

A) after the recursive method call
B) before the recursive method call
C) before the next method
D) after the next method
E) None of these

Question 17

The following is an example of a base case for a summation algorithm (the sum of the numbers from 0 to n): If n > 0 then summation (n) = n + summation (n-1)

Question 18

The depth of recursion for a method that calls itself five times is six.

Question 19

Which of the following would be a recursive case for a summation algorithm (the sum of the numbers from 0 to n)?

A) If n = 0 then summation(n) = 0
B) if n > 0 then summation(n) = 5
C) If n > 0 then summation(n) = getValue(n)
D) If n > 0 then summation(n) = n + summation(n-1)
E) None of these

Question 20

A method that calls itself is referred to as a(n):

A) depth method
B) iterative method
C) recursive method
D) repetitive method
E) None of these

Question 21

The following is an example of a(n) ___________________ case for a summation algorithm (the sum of the numbers from 0 to n): If n = 0 then summation(n) = 0

Question 22

Usually, a problem is reduced by making the value of a(n) ___________________ smaller with each recursive call.

Question 23

The following is an example of a(n) ___________________ case for a summation algorithm (the sum of the numbers from 0 to n): If n > 0 then summation(n) = n + summation(n-1)

Question 24

The number of times that a method calls itself is known as the ___________________ of recursion.

Question 25

The ___________________ case the problem is solved without recursion.

Question 26

In the ___________________ case the problem is reduced to a smaller version of the original problem.

Question 27

Any problem that can be solved with recursion can also be solved with a(n)___________________.

Question 28

A problem can be solved with ___________________ if it can be broken down into successive smaller problems that are identical to the overall problem.