Question 1

The idea of __________ is to reduce the size of a problem at each step so that we eventually arrive at a very small, easy-to-solve problem.

Accepted Answer

A)  recursion 
B)  iteration 
C)  reduction 
D)  generalization 
A)  recursion 
B)  iteration 
C)  reduction 
D)  generalization

Question 2

What would be a good first base case if you were determining whether a String is a palindrome?

Accepted Answer

A)  If the String is the empty String or contains only 1 character, it is a palindrome. 
B)  The method calls itself indefinitely until it finds a palindrome. 
C)  The String calls the first character and then terminates. 
D)  There is only one character left. 
A)  If the String is the empty String or contains only 1 character, it is a palindrome. 
B)  The method calls itself indefinitely until it finds a palindrome. 
C)  The String calls the first character and then terminates. 
D)  There is only one character left.

Question 3

With a tail recursive method, the ___________ stays the same.

Accepted Answer

A)  return value 
B)  recursive call 
C)  parameter value 
D)  modulus operation 
A)  return value 
B)  recursive call 
C)  parameter value 
D)  modulus operation

Question 4

Why is recursion often slower than iteration?

Accepted Answer

A)  Although the coding is elegant, implementation takes longer. 
B)  There is overhead associated with recursive method calls. 
C)  Running times are of the same order of magnitude. 
D)  The general case can be more difficult to solve. 
A)  Although the coding is elegant, implementation takes longer. 
B)  There is overhead associated with recursive method calls. 
C)  Running times are of the same order of magnitude. 
D)  The general case can be more difficult to solve.

Question 5

Recursion allows us to do which of the following?

Accepted Answer

A)  We can solve a large problem by reducing it to smaller problems until we find a problem that we can solve. 
B)  We can redefine classes for reuse. 
C)  We can define large problems for experts to solve. 
D)  All of these are correct. 
A)  We can solve a large problem by reducing it to smaller problems until we find a problem that we can solve. 
B)  We can redefine classes for reuse. 
C)  We can define large problems for experts to solve. 
D)  All of these are correct.

Question 6

The efficiency of the method at execution time is called the:

Accepted Answer

A)  array time. 
B)  if/else report. 
C)  running time. 
D)  status. 
A)  array time. 
B)  if/else report. 
C)  running time. 
D)  status.

Question 7

Which code would you use to trace recursive calls, where the desired expression goes inside the parentheses?

Accepted Answer

A)  System.out.println ( ) 
B)  System.print.trace ( ) 
C)  System.traceprint ( ) 
D)  if System.out ( ) 
A)  System.out.println ( ) 
B)  System.print.trace ( ) 
C)  System.traceprint ( ) 
D)  if System.out ( )

Question 8

Identify the two things you must define in order to construct a recursive solution to a problem.

Accepted Answer

Base case

Question 9

Evaluate why a recursion method is useful for calculating the greatest common divisor.

Accepted Answer

The recursion method allows us to solve

Question 10

A recursive function is implemented using decision constructs, while an iterative function is implemented with looping constructs.

Accepted Answer

A) True 
 B)False

Question 11

Each execution of the recursive method must wait to return its value until its recursive call to the method returns a value.

Accepted Answer

A) True 
 B)False

Question 12

Usually, not coding the base case will result in a runtime exception caused by the infinite number of recursive calls.

Accepted Answer

A) True 
 B)False

Question 13

In solving the Towers of Hanoi problem, when the if statement identifies the base case, it allows the program to keep moving disks until there are no more disks to move.

Accepted Answer

A) True 
 B)False

Question 14

A factorial method is complete when it generates:

Accepted Answer

A)  a recursive call to the factorial method with the argument 0. 
B)  an indefinite method. 
C)  a recursive call to the factorial method with the argument -1. 
D)  None of these is correct. 
A)  a recursive call to the factorial method with the argument 0. 
B)  an indefinite method. 
C)  a recursive call to the factorial method with the argument -1. 
D)  None of these is correct.

Question 15

List three features that make using an iteration preferable to a recursion in printing "Happy Birthday" 10 times.

Accepted Answer

Answers could include: This is

Question 16

When the recursive calls all the way to the base case and the return value stays the same throughout the process, the method is called:

Accepted Answer

A)  stack overflow. 
B)  tail recursive. 
C)  uniform recursive. 
D)  None of these is correct. 
A)  stack overflow. 
B)  tail recursive. 
C)  uniform recursive. 
D)  None of these is correct.

Question 17

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

Accepted Answer

A)  base case. 
B)  general case. 
C)  method. 
D)  class. 
A)  base case. 
B)  general case. 
C)  method. 
D)  class.

Question 18

It is possible that a method does nothing in the base case.

Accepted Answer

A) True 
 B)False

Question 19

Which of the following are reasons to choose recursion over iteration?

Accepted Answer

A)  Run times are equivalent. 
B)  Recursion implementation is easier to understand. 
C)  The equivalent iteration implementation would be harder to understand. 
D)  All of these are correct. 
A)  Run times are equivalent. 
B)  Recursion implementation is easier to understand. 
C)  The equivalent iteration implementation would be harder to understand. 
D)  All of these are correct.

Question 20

If there are two recursive terms on the right side of the formula, there will be one base case.

Accepted Answer

A) True 
 B)False

The idea of __________ is to reduce the size of a problem at each step so that we eventually arrive at a very small, easy-to-solve problem.

What would be a good first base case if you were determining whether a String is a palindrome?

With a tail recursive method, the ___________ stays the same.

Why is recursion often slower than iteration?

Recursion allows us to do which of the following?

The efficiency of the method at execution time is called the:

Which code would you use to trace recursive calls, where the desired expression goes inside the parentheses?

Identify the two things you must define in order to construct a recursive solution to a problem.

Evaluate why a recursion method is useful for calculating the greatest common divisor.

A recursive function is implemented using decision constructs, while an iterative function is implemented with looping constructs.

Each execution of the recursive method must wait to return its value until its recursive call to the method returns a value.

Usually, not coding the base case will result in a runtime exception caused by the infinite number of recursive calls.

In solving the Towers of Hanoi problem, when the if statement identifies the base case, it allows the program to keep moving disks until there are no more disks to move.

A factorial method is complete when it generates:

List three features that make using an iteration preferable to a recursion in printing "Happy Birthday" 10 times.

When the recursive calls all the way to the base case and the return value stays the same throughout the process, the method is called:

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

It is possible that a method does nothing in the base case.

Which of the following are reasons to choose recursion over iteration?

If there are two recursive terms on the right side of the formula, there will be one base case.

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

The idea of __________ is to reduce the size of a problem at each step so that we eventually arrive at a very small, easy-to-solve problem.

What would be a good first base case if you were determining whether a String is a palindrome?

With a tail recursive method, the ___________ stays the same.

Why is recursion often slower than iteration?

Recursion allows us to do which of the following?

The efficiency of the method at execution time is called the:

Which code would you use to trace recursive calls, where the desired expression goes inside the parentheses?

Identify the two things you must define in order to construct a recursive solution to a problem.

Evaluate why a recursion method is useful for calculating the greatest common divisor.

A recursive function is implemented using decision constructs, while an iterative function is implemented with looping constructs.

Each execution of the recursive method must wait to return its value until its recursive call to the method returns a value.

Usually, not coding the base case will result in a runtime exception caused by the infinite number of recursive calls.

In solving the Towers of Hanoi problem, when the if statement identifies the base case, it allows the program to keep moving disks until there are no more disks to move.

A factorial method is complete when it generates:

List three features that make using an iteration preferable to a recursion in printing "Happy Birthday" 10 times.

When the recursive calls all the way to the base case and the return value stays the same throughout the process, the method is called:

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

It is possible that a method does nothing in the base case.

Which of the following are reasons to choose recursion over iteration?

If there are two recursive terms on the right side of the formula, there will be one base case.

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