Question 1

This type of method is a method that calls itself.

Accepted Answer

A)  Looping 
B)  Circular 
C)  Recursive 
D)  Reoccurring 
A)  Looping 
B)  Circular 
C)  Recursive 
D)  Reoccurring

Question 2

Look at the following method: public static int Test2(int x, int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (Test2(x - y, y + 5) + 6);
}
}
What is the base case for the method?

Accepted Answer

A)  x < y 
B)  -5 
C)  Test2(x - y, y + 5) + 6 
D)  +6 
A)  x < y 
B)  -5 
C)  Test2(x - y, y + 5) + 6 
D)  +6

Question 3

Look at the following pseudocode algorithm: algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8) + 8)
End Test14
What value is returned for Test14(7)?

Accepted Answer

A)  0 
B)  7 
C)  14 
D)  -5 
A)  0 
B)  7 
C)  14 
D)  -5

Question 4

Look at the following method: public static int test2(int x, int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (test2(x - y, y + 5) + 6);
}
}
What is returned for test2(10, 20)?

Accepted Answer

A)  6 
B)  10 
C)  1 
D)  -5 
A)  6 
B)  10 
C)  1 
D)  -5

Question 5

Recursive algorithms are usually less efficient than iterative algorithms.

Accepted Answer

A) True 
 B)False

Question 6

The Towers of Hanoi is:

Accepted Answer

A)  a mathematical game 
B)  often used in computer science textbooks 
C)  demonstrates the power of recursion 
D)  all of the above 
A)  a mathematical game 
B)  often used in computer science textbooks 
C)  demonstrates the power of recursion 
D)  all of the above

Question 7

How many times will the following method call itself if the value 10 is passed as an argument?
Public static void message(int n)
{
If (n > 0)
{
System.out.println("Print this line.
");
Message(n + 1);
}
}

Accepted Answer

A)  1 
B)  9 
C)  10 
D)  An infinite number of times 
A)  1 
B)  9 
C)  10 
D)  An infinite number of times

Question 8

To solve a program recursively, you need to identify at least one case in which the problem can be solved without recursion - this is known as the:

Accepted Answer

A)  recursive case 
B)  terminal case 
C)  base case 
D)  final case 
A)  recursive case 
B)  terminal case 
C)  base case 
D)  final case

Question 9

Like a loop, a recursive method must have:

Accepted Answer

A)  a counter 
B)  some way to control the number of times it repeats itself 
C)  a return statement 
D)  a predetermined number of times it will execute before terminating 
A)  a counter 
B)  some way to control the number of times it repeats itself 
C)  a return statement 
D)  a predetermined number of times it will execute before terminating

Question 10

Look at the following pseudocode algorithm: algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8) + 8)
End Test14
What value is returned for Test14(16)?

Accepted Answer

A)  8 
B)  16 
C)  24 
D)  32 
A)  8 
B)  16 
C)  24 
D)  32

Question 11

The actions that the JVM must perform any time a method is called are known as:

Accepted Answer

A)  Stack depth 
B)  Overhead 
C)  Housekeeping 
D)  Method calls 
A)  Stack depth 
B)  Overhead 
C)  Housekeeping 
D)  Method calls

Question 12

Look at the following method: public static int test2(int x, int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (test2(x - y, y + 5) + 6);
}
}
What is the recursive case for the method?

Accepted Answer

A)  x = y 
D)  x != y 
A)  x = y 
D)  x != y

Question 13

Indirect recursion occurs when:

Accepted Answer

A)  a loop is used to solve a recursive problem 
B)  a recursive method has no code to stop it from repeating 
C)  a method calls itself 
D)  a method calls itself from another method 
A)  a loop is used to solve a recursive problem 
B)  a recursive method has no code to stop it from repeating 
C)  a method calls itself 
D)  a method calls itself from another method

Question 14

Which of the following problems can be programmed recursively?

Accepted Answer

A)  Towers of Hanoi 
B)  Quicksort 
C)  Binary search 
D)  All of the above 
A)  Towers of Hanoi 
B)  Quicksort 
C)  Binary search 
D)  All of the above

Question 15

If method A calls method B, which in turn calls method A, it is called indirect recursion.

Accepted Answer

A) True 
 B)False

Question 16

Indirect recursion occurs when a method calls another method that in turn calls the first method.

Accepted Answer

A) True 
 B)False

Question 17

In Java, it is not possible for a method to call itself.

Accepted Answer

A) True 
 B)False

Question 18

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

A) True 
 B)False

Question 19

Recursion can be a powerful tool for solving:

Accepted Answer

A)  basic problems 
B)  repetitive problems 
C)  object-oriented problems 
D)  binary problems 
A)  basic problems 
B)  repetitive problems 
C)  object-oriented problems 
D)  binary problems

Question 20

Usually, a problem is reduced by making the value of one or more parameters ________ with each recursive call.

Accepted Answer

A)  larger 
B)  smaller 
C)  negative 
D)  equal 
A)  larger 
B)  smaller 
C)  negative 
D)  equal

This type of method is a method that calls itself.

Look at the following method: public static int Test2(int x, int y) { If ( x < y) { Return -5; } Else { Return (Test2(x - y, y + 5) + 6); } } What is the base case for the method?

Look at the following pseudocode algorithm: algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What value is returned for Test14(7)?

Look at the following method: public static int test2(int x, int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y, y + 5) + 6); } } What is returned for test2(10, 20)?

Recursive algorithms are usually less efficient than iterative algorithms.

The Towers of Hanoi is:

How many times will the following method call itself if the value 10 is passed as an argument? Public static void message(int n) { If (n > 0) { System.out.println("Print this line.\n"); Message(n + 1); } }

To solve a program recursively, you need to identify at least one case in which the problem can be solved without recursion - this is known as the:

Like a loop, a recursive method must have:

Look at the following pseudocode algorithm: algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What value is returned for Test14(16)?

The actions that the JVM must perform any time a method is called are known as:

Look at the following method: public static int test2(int x, int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y, y + 5) + 6); } } What is the recursive case for the method?

Indirect recursion occurs when:

Which of the following problems can be programmed recursively?

If method A calls method B, which in turn calls method A, it is called indirect recursion.

Indirect recursion occurs when a method calls another method that in turn calls the first method.

In Java, it is not possible for a method to call itself.

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

Recursion can be a powerful tool for solving:

Usually, a problem is reduced by making the value of one or more parameters ________ with each recursive call.

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

Arrays and the Arraylist Class

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File IO

A First Look at GUI Applications

Advanced GUI Applications

Applets and More

Creating GUI Applications With Javafx and Scene Builder

Databases

Filters

Exam 16: Recursion

This type of method is a method that calls itself.

Look at the following method: public static int Test2(int x, int y) { If ( x < y) { Return -5; } Else { Return (Test2(x - y, y + 5) + 6); } } What is the base case for the method?

Look at the following pseudocode algorithm: algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What value is returned for Test14(7)?

Look at the following method: public static int test2(int x, int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y, y + 5) + 6); } } What is returned for test2(10, 20)?

Recursive algorithms are usually less efficient than iterative algorithms.

The Towers of Hanoi is:

How many times will the following method call itself if the value 10 is passed as an argument? Public static void message(int n) { If (n > 0) { System.out.println("Print this line.\n"); Message(n + 1); } }

To solve a program recursively, you need to identify at least one case in which the problem can be solved without recursion - this is known as the:

Like a loop, a recursive method must have:

Look at the following pseudocode algorithm: algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What value is returned for Test14(16)?

The actions that the JVM must perform any time a method is called are known as:

Look at the following method: public static int test2(int x, int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y, y + 5) + 6); } } What is the recursive case for the method?

Indirect recursion occurs when:

Which of the following problems can be programmed recursively?

If method A calls method B, which in turn calls method A, it is called indirect recursion.

Indirect recursion occurs when a method calls another method that in turn calls the first method.

In Java, it is not possible for a method to call itself.

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

Recursion can be a powerful tool for solving:

Usually, a problem is reduced by making the value of one or more parameters ________ with each recursive call.

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

Arrays and the Arraylist Class

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File IO

A First Look at GUI Applications

Advanced GUI Applications

Applets and More

Creating GUI Applications With Javafx and Scene Builder

Databases

Filters