Question 1

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 problems involve breaking down the problem into smaller, identical subproblems and solving them in a similar way until the base case is reached.

Question 2

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

Accepted Answer

Recursion is indeed a powerful and important concept in computer science, and is commonly used to solve problems that involve repetitive tasks or patterns. It is often covered in depth in upper-level computer science courses and is an important tool for any programmer to have in their toolkit.

Question 3

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

B

Question 4

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

Accepted Answer

Direct recursion involves a method calling itself directly. Indirect recursion involves a cycle of methods calling each other, but not directly calling themselves. Basic recursion and static recursion are not commonly used terms in the context of recursion.

Question 5

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

Accepted Answer

The recursive case in a recursive function is the part that continues the recursion by calling the function itself, while the base case is what stops the chain of recursive calls.

Question 6

__________ occurs when method A calls method B which in turn calls method&#10;A)&#10;A) Dynamic recursion&#10;B) Linear recursion&#10;C) Direct recursion&#10;D) Indirect recusion

Accepted Answer

Indirect recursion occurs when method A calls method B, which then calls method A.

Question 7

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) pont of absolution

Accepted Answer

The base case is the point in the recursion where the problem can be solved without further recursion. Therefore, it is the case in which a problem can be solved without recursion. The other choices are not correct because the recursive case is the point where recursion continues to occur, the termination point is not a commonly used term in recursion, and the point of absolution is not a term used in recursion at all.

Question 8

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

Accepted Answer

Any problem that can be solved recursively can also be solved iteratively using a loop. This is because the iterative solution essentially mimics the steps of the recursive solution, but instead of calling the function again, it uses variables and control structures to achieve the same result. However, the reverse is not always true - some problems may only have a recursive solution and cannot be solved iteratively.

Question 9

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 time it repeats&#10;D) All of these

Accepted Answer

Recursive methods need a condition to stop the recursion, effectively controlling the number of times the method calls itself. This is not necessarily about incrementing a control variable or initializing a control variable to a starting value, but about having a base case to prevent infinite recursion.

Question 10

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

Accepted Answer

Without a base case, a recursive method may call itself multiple times before eventually causing a runtime error such as a stack overflow.

Question 11

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 these.

Accepted Answer

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

Question 12

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

Accepted Answer

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

Question 13

A recursive method can have only one base case.

Accepted Answer

The answer of A recursive method can have only one...

Question 14

In a recursive program, the number of times 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 answer of In a recursive program, the number of...

Question 15

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 16

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 17

Recursion is never absolutely required to solve a problem.

Accepted Answer

The answer of Recursion is never absolutely required to solve...

Question 18

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 answer of The Towers of Hanoi is a mathematical...

Question 19

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 20

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

Accepted Answer

The answer of The actions performed by the JVM that...

Question 21

To use recursion for a binary search, what is required before the search can proceed?&#10;A) The array must include only integers.&#10;B) The array can only include numerical values.&#10;C) The array must be sorted.&#10;D) All of these are required.

Accepted Answer

The answer of To use recursion for a binary search,...

Question 22

In the following code that uses recursion to find the greatest common divisor of a number, what is the base case?
public static int gcd(int x, int y)
{
If (x % y == 0)
Return y;
Else
Return gcd(y, x % y);
}

A) gcd(int x, int y)
B) if (x % y == 0)
Return y;
C) else
Return gcd(y, x % y);
D) Cannot tell from this code

Accepted Answer

The answer of In the following code that uses recursion...

Question 23

In the following code that uses recursion to find the greatest common divisor of a number, what is the base case?
public static int gcd(int x, int y)
{
If (x % y == 0)
Return y;
Else
Return gcd(y, x % y);
}

A) gcd(int x, int y)
B) if (x % y == 0)
Return y;
C) else
Return gcd(y, x % y);
D) Cannot tell from this code

Accepted Answer

The answer of In the following code that uses recursion...

Question 24

Given the following code that uses recursion to find the factorial of a number, how many times will the else clause be executed if n = 5?
private static int factorial(int n)
{
If (n == 0)
Return 1;
Else
Return n * factorial(n - 1);
}

A) 3
B) 4
C) 5
D) 6

Accepted Answer

The answer of Given the following code that uses recursion...

Deck 14: Recursion