Question 1

The Towers of Hanoi is a mathematical game that is often used in computer science textbooks to illustrate the power of recursion.

Accepted Answer

The Towers of Hanoi is a classic example of recursion in computer science and is commonly used in textbooks to illustrate the concept.

Question 2

This occurs when method A calls method B, which in turn calls method A.&#10;A) dynamic recursion&#10;B) linear recursion&#10;C) direct recursion&#10;D) indirect recursion

Accepted Answer

Indirect recursion occurs when two or more methods call each other in a circular manner. In this case, method A calls method B, and then method B calls method A.

Question 3

Recursion is never absolutely required to solve a problem.

Accepted Answer

Any problem that can be solved recursively can also be solved using iterative methods, although recursion might be a more natural or simpler approach for some problems.

Question 4

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

Accepted Answer

Recursive problem solving involves breaking down a larger problem into smaller identical problems that can be solved using the same approach as the overall problem. Each smaller problem can then be further broken down into even smaller problems until a base case is reached, at which point the solutions of the smaller problems can be combined to solve the original problem.

Question 5

Without a base case, a recursive method will call itself only once and stop.

Accepted Answer

Without a base case, the recursive method will keep calling itself indefinitely, causing a stack overflow eventually.

Question 6

When recursive methods directly call themselves, it is known as this.&#10;A) direct recursion&#10;B) indirect recursion&#10;C) basic recursion&#10;D) static recursion

Accepted Answer

Direct recursion refers to recursive methods that call themselves directly.

Question 7

The number of times that a method calls itself is known as&#10;A) the call count.&#10;B) the cyclic identity.&#10;C) the method heap.&#10;D) the depth of recursion.

Accepted Answer

The number of times that a method calls itself is referred to as the depth of recursion. This meaning can also be explicitly conveyed in the given options by choice D, which is the correct answer.

Question 8

The actions performed by the JVM that take place with each method call are sometimes referred to as this.&#10;A) overhead&#10;B) allocation&#10;C) overflow&#10;D) retention

Accepted Answer

The actions performed by the JVM with each method call can be considered as overhead. These actions include allocating memory for the method call, setting up the stack frame, and managing the method's execution.

Question 9

A recursive method can have no more than one base case.

Accepted Answer

A recursive method can have multiple base cases, each defining a different stopping condition for the recursive function.

Question 10

Any problem that can be solved recursively can also be solved iteratively, with a loop.

Accepted Answer

This is true, as any problem that can be solved recursively essentially breaks the problem down into smaller subproblems until a base case is reached. This can also be achieved through the use of a loop, where each iteration solves a smaller subproblem until the base case is reached. Therefore, any recursive solution can also be converted to an iterative solution using a loop.

Question 11

The recursive case does not require recursion, so it stops the chain of recursive calls.

Accepted Answer

The answer of The recursive case does not require recursion,...

Question 12

A method that calls itself is a ________ method.&#10;A) recursive&#10;B) redundant&#10;C) binary&#10;D) derived

Accepted Answer

The answer of A method that calls itself is a...

Question 13

The recursive binary search algorithm is a good example of repeatedly breaking a problem down into smaller pieces until it is solved.

Accepted Answer

The answer of The recursive binary search algorithm is a...

Question 14

In the ________, we must always reduce the problem to a smaller version of the original problem.&#10;A) base case&#10;B) partition case&#10;C) lessening case&#10;D) recursive case

Accepted Answer

The answer of In the ________, we must always reduce...

Question 15

Which of the following problems can be solved recursively?&#10;A) greatest common denominator&#10;B) towers of Hanoi&#10;C) binary search&#10;D) All of the Above

Accepted Answer

The answer of Which of the following problems can be...

Question 16

Like a loop, a recursive method must have which of the following?&#10;A) a statement that increments the control variable&#10;B) a control variable initialized to a starting value&#10;C) some way to control the number of times it repeats&#10;D) All of the above

Accepted Answer

The answer of Like a loop, a recursive method must...

Question 17

The ________ is at least one case in which a problem can be solved without recursion.&#10;A) recursive case&#10;B) base case&#10;C) termination point&#10;D) point of absolution

Accepted Answer

The answer of The ________ is at least one case...

Question 18

Recursion can be a powerful tool for solving repetitive problems and is an important topic in upper-level computer science courses.

Accepted Answer

The answer of Recursion can be a powerful tool for...

Question 19

Whereas a recursive algorithm might result in faster execution time, the programmer might be able to design an iterative algorithm faster.

Accepted Answer

The answer of Whereas a recursive algorithm might result in...

Question 20

A method is called from the main method for the first time. It then calls itself seven times. What is the depth of recursion?&#10;A) 1&#10;B) 7&#10;C) 8&#10;D) 6

Accepted Answer

The answer of A method is called from the main...

Deck 15: Recursion