Question 1

If your method implementation does not animate or animates incorrectly, which of the following should you do?

Accepted Answer

A)  Verify that you coded the base cases correctly. 
B)  Verify that you coded the tail recursive correctly. 
C)  Check the feedback on the input to see if the code gives the correct result. 
D)  All of these are correct. 
A)  Verify that you coded the base cases correctly. 
B)  Verify that you coded the tail recursive correctly. 
C)  Check the feedback on the input to see if the code gives the correct result. 
D)  All of these are correct. A

Question 2

Using the gcd method, Aidan coded a program to find the common divisor for 43,822 and 52,003. Instead, he got a StackOverflowError. Infer what happened.

Accepted Answer

The base case wasn't identified.

Question 3

When a method is called, the JVM stores the method's arguments and the caller's return address on a(n):

Accepted Answer

A)  overflow. 
B)  factorial. 
C)  tower. 
D)  None of these is correct. 
A)  overflow. 
B)  factorial. 
C)  tower. 
D)  None of these is correct. D

Question 4

Failure to code the base case will result in a runtime error.

Accepted Answer

A) True 
 B)False

Question 5

Why might you want to use a recursive method instead of a loop?

Accepted Answer

A)  The code is more compact. 
B)  The code is more elegant. 
C)  The code is simpler. 
D)  All of these are correct. 
A)  The code is more compact. 
B)  The code is more elegant. 
C)  The code is simpler. 
D)  All of these are correct.

Question 6

Typically, recursion uses selection and iteration uses looping.

Accepted Answer

A) True 
 B)False

Question 7

A base case must have the words "base case" in order to be coded correctly.

Accepted Answer

A) True 
 B)False

Question 8

A recursive method can be a value-returning method.

Accepted Answer

A) True 
 B)False

Question 9

You are considering running a program similar to the Tower of Hanoi. Which of the following is true?

Accepted Answer

A)  Iteration would probably be more elegant. 
B)  Recursion would probably be easier to understand. 
C)  Recursion would probably have a faster run time. 
D)  Iteration would probably be easier to implement. 
A)  Iteration would probably be more elegant. 
B)  Recursion would probably be easier to understand. 
C)  Recursion would probably have a faster run time. 
D)  Iteration would probably be easier to implement.

Question 10

An iterative function is implemented with looping constructs (e.g., while or for statements) and repeatedly executes the loop.

Accepted Answer

A) True 
 B)False

Question 11

Which of the following defines the general case?

Accepted Answer

A)  if (n > 0 ) 
B)  public static void main( String [n > 0] ) 
C)  else // n = 0 
D)  public base case void (n > 0) 
A)  if (n > 0 ) 
B)  public static void main( String [n > 0] ) 
C)  else // n = 0 
D)  public base case void (n > 0)

Question 12

In the body of a recursive method, there is a call to the method itself.

Accepted Answer

A) True 
 B)False

Question 13

What is the factorial of -12?

Accepted Answer

The answer of What is the factorial of -12?...

Question 14

The factorial of 6 is __________.

Accepted Answer

The answer of The factorial of 6 is __________....

Question 15

A binary search is more easily coded using iteration rather than recursion.

Accepted Answer

A) True 
 B)False

Question 16

In a value-returning method, the return statement can include a call to another value-returning method.

Accepted Answer

A) True 
 B)False

Question 17

Using recursion, the size of a problem is always reduced by 1 (i.e., from n to n − 1).

Accepted Answer

A) True 
 B)False

Question 18

Write a recursive formula in which the following conditions apply:
In the first term, both method parameters, n and p, have each been decreased by 1.
In the second term, n is unchanged, while p is decreased by 1.

Accepted Answer

Combinations( n, p )

Question 19

When searching for a value in an array, what are the possible outcomes?

Accepted Answer

A)  We find the value and return its array index. 
B)  We do not find the value and return -1. 
C)  We find the value and return its array index or we do not find the value and return -1. 
D)  None of these is correct. 
A)  We find the value and return its array index. 
B)  We do not find the value and return -1. 
C)  We find the value and return its array index or we do not find the value and return -1. 
D)  None of these is correct.

Question 20

Lynn is having a dinner party for six people. She wrote a factorial program to find out how many possible seating arrangements she has available, but she was stunned when the result was 720. That is too many options. How could she improve her program so that she can find a number of possibilities that she could work with? If she finds that number, how could she incorporate it in her seating decisions?

Accepted Answer

Answers will vary: She could include som

If your method implementation does not animate or animates incorrectly, which of the following should you do?

Using the gcd method, Aidan coded a program to find the common divisor for 43,822 and 52,003. Instead, he got a StackOverflowError. Infer what happened.

When a method is called, the JVM stores the method's arguments and the caller's return address on a(n):

Failure to code the base case will result in a runtime error.

Why might you want to use a recursive method instead of a loop?

Typically, recursion uses selection and iteration uses looping.

A base case must have the words "base case" in order to be coded correctly.

A recursive method can be a value-returning method.

You are considering running a program similar to the Tower of Hanoi. Which of the following is true?

An iterative function is implemented with looping constructs (e.g., while or for statements) and repeatedly executes the loop.

Which of the following defines the general case?

In the body of a recursive method, there is a call to the method itself.

What is the factorial of -12?

The factorial of 6 is __________.

A binary search is more easily coded using iteration rather than recursion.

In a value-returning method, the return statement can include a call to another value-returning method.

Using recursion, the size of a problem is always reduced by 1 (i.e., from n to n − 1).

Write a recursive formula in which the following conditions apply: In the first term, both method parameters, n and p, have each been decreased by 1. In the second term, n is unchanged, while p is decreased by 1.

When searching for a value in an array, what are the possible outcomes?

Introduction to Programming and the Java Language

Programming Building Blocks- Java Basics

Object-Oriented Programming, Part 1: Using Classes

Introduction to Graphical Applications

Flow of Control, Part 1: Selection

Flow of Control, Part 2: Looping

Object-Oriented Programming, Part 2: User-Defined Classes

Single-Dimensional Arrays

Multidimensional Arrays and the Arraylist Class

Object-Oriented Programming, Part 3: Inheritance, Polymorphism, and Interfaces

Exceptions, and Input Output Operations

Graphical User Interfaces Using Java FX

An Introduction to Data Structures

Running Time Analysis

RGB Colors, Decimal Conversion, Java Naming, and Random Number Generation

Filters

Exam 13: Recursion

If your method implementation does not animate or animates incorrectly, which of the following should you do?

Using the gcd method, Aidan coded a program to find the common divisor for 43,822 and 52,003. Instead, he got a StackOverflowError. Infer what happened.

When a method is called, the JVM stores the method's arguments and the caller's return address on a(n):

Failure to code the base case will result in a runtime error.

Why might you want to use a recursive method instead of a loop?

Typically, recursion uses selection and iteration uses looping.

A base case must have the words "base case" in order to be coded correctly.

A recursive method can be a value-returning method.

You are considering running a program similar to the Tower of Hanoi. Which of the following is true?

An iterative function is implemented with looping constructs (e.g., while or for statements) and repeatedly executes the loop.

Which of the following defines the general case?

In the body of a recursive method, there is a call to the method itself.

What is the factorial of -12?

The factorial of 6 is __________.

A binary search is more easily coded using iteration rather than recursion.

In a value-returning method, the return statement can include a call to another value-returning method.

Using recursion, the size of a problem is always reduced by 1 (i.e., from n to n − 1).

Write a recursive formula in which the following conditions apply: In the first term, both method parameters, n and p, have each been decreased by 1. In the second term, n is unchanged, while p is decreased by 1.

When searching for a value in an array, what are the possible outcomes?

Introduction to Programming and the Java Language

Programming Building Blocks- Java Basics

Object-Oriented Programming, Part 1: Using Classes

Introduction to Graphical Applications

Flow of Control, Part 1: Selection

Flow of Control, Part 2: Looping

Object-Oriented Programming, Part 2: User-Defined Classes

Single-Dimensional Arrays

Multidimensional Arrays and the Arraylist Class

Object-Oriented Programming, Part 3: Inheritance, Polymorphism, and Interfaces

Exceptions, and Input Output Operations

Graphical User Interfaces Using Java FX

An Introduction to Data Structures

Running Time Analysis

RGB Colors, Decimal Conversion, Java Naming, and Random Number Generation

Filters