Question 1

Recursion is a programming technique in which a method calls itself.

Accepted Answer

A) True 
 B)False  True

Question 2

Mathematical problems and formulas are never expressed recursively.

Accepted Answer

A) True 
 B)False  False

Question 3

When should recursion be avoided?

Accepted Answer

Avoid recursion when the iterative solution is simpler and more easily understood and programmed. Recursion has the overhead of multiple method calls and is not always intuitive.

Question 4

What is infinite recursion?

Accepted Answer

Infinite recursion occurs when there is

Question 5

Recursion is a programming technique in which a ________ calls itself.

Accepted Answer

A)  program 
B)  method 
C)  variable 
D)  parameter 
A)  program 
B)  method 
C)  variable 
D)  parameter

Question 6

Any recursive definition must have a non-recursive part, called the ___________, which permits the recursion to eventually end.

Accepted Answer

A)  base case 
B)  foundation 
C)  primary case 
D)  first case 
A)  base case 
B)  foundation 
C)  primary case 
D)  first case

Question 7

Recursion is the most elegant and appropriate way to solve ________ problems, but for others it is less intuitive than an iterative solution.

Accepted Answer

A)  some 
B)  most 
C)  all 
D)  none of the above 
A)  some 
B)  most 
C)  all 
D)  none of the above

Question 8

What is the output of the following program?

Accepted Answer

The answer of What is the output of the following...

Question 9

If a problem can be solved with iteration, it cannot be solved with recursion

Accepted Answer

A) True 
 B)False

Question 10

Recursion is the most elegant and appropriate way to solve some problems, but for others it is less intuitive than an iterative solution.

Accepted Answer

A) True 
 B)False

Question 11

Each recursive call to a method creates ______ local variables and parameters.

Accepted Answer

The answer of Each recursive call to a method creates...

Question 12

If method m1 invokes m2 which invokes m3 which invokes m1 again, then this is an example of ______

Accepted Answer

The answer of If method m1 invokes m2 which invokes...

Question 13

The Towers of Hanoi solution has exponential complexity, which is very inefficient. Yet the implementation of the solution is incredibly short and ______.

Accepted Answer

The answer of The Towers of Hanoi solution has exponential...

Question 14

A careful _______ of recursive processing can provide insight into the way it is used to solve a problem.

Accepted Answer

A)  review 
B)  trace 
C)  observation 
D)  use 
A)  review 
B)  trace 
C)  observation 
D)  use

Question 15

Each recursive call to a method creates new __________ and __________.

Accepted Answer

A)  Local variables 
B)  Parameters 
C)  Methods 
D)  A and B 
A)  Local variables 
B)  Parameters 
C)  Methods 
D)  A and B

Question 16

The order of a recursive algorithm can be determined using techniques similar to analyzing iterative processing.

Accepted Answer

A) True 
 B)False

Question 17

Mathematical problems and formulas are often expressed ______.

Accepted Answer

The answer of Mathematical problems and formulas are often expressed...

Question 18

A recursive definition without a base-case will lead to ______.

Accepted Answer

The answer of A recursive definition without a base-case will...

Question 19

Any recursive definition must have a nonrecursive part, called the base case, which permits the recursion to eventually end.

Accepted Answer

A) True 
 B)False

Question 20

A careful trace of recursive processing can provide insight into the way it is used to solve a problem.

Accepted Answer

A) True 
 B)False

Recursion is a programming technique in which a method calls itself.

Mathematical problems and formulas are never expressed recursively.

When should recursion be avoided?

What is infinite recursion?

Recursion is a programming technique in which a ________ calls itself.

Any recursive definition must have a non-recursive part, called the ___________, which permits the recursion to eventually end.

Recursion is the most elegant and appropriate way to solve ________ problems, but for others it is less intuitive than an iterative solution.

What is the output of the following program?

If a problem can be solved with iteration, it cannot be solved with recursion

Recursion is the most elegant and appropriate way to solve some problems, but for others it is less intuitive than an iterative solution.

Each recursive call to a method creates ______ local variables and parameters.

If method m1 invokes m2 which invokes m3 which invokes m1 again, then this is an example of ______

The Towers of Hanoi solution has exponential complexity, which is very inefficient. Yet the implementation of the solution is incredibly short and ______.

A careful _______ of recursive processing can provide insight into the way it is used to solve a problem.

Each recursive call to a method creates new and .

The order of a recursive algorithm can be determined using techniques similar to analyzing iterative processing.

Mathematical problems and formulas are often expressed ______.

A recursive definition without a base-case will lead to ______.

Any recursive definition must have a nonrecursive part, called the base case, which permits the recursion to eventually end.

A careful trace of recursive processing can provide insight into the way it is used to solve a problem.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

Exam 7: Iterators

Recursion is a programming technique in which a method calls itself.

Mathematical problems and formulas are never expressed recursively.

When should recursion be avoided?

What is infinite recursion?

Recursion is a programming technique in which a ________ calls itself.

Any recursive definition must have a non-recursive part, called the ___________, which permits the recursion to eventually end.

Recursion is the most elegant and appropriate way to solve ________ problems, but for others it is less intuitive than an iterative solution.

What is the output of the following program?

If a problem can be solved with iteration, it cannot be solved with recursion

Recursion is the most elegant and appropriate way to solve some problems, but for others it is less intuitive than an iterative solution.

Each recursive call to a method creates ______ local variables and parameters.

If method m1 invokes m2 which invokes m3 which invokes m1 again, then this is an example of ______

The Towers of Hanoi solution has exponential complexity, which is very inefficient. Yet the implementation of the solution is incredibly short and ______.

A careful _______ of recursive processing can provide insight into the way it is used to solve a problem.

Each recursive call to a method creates new __________ and __________.

The order of a recursive algorithm can be determined using techniques similar to analyzing iterative processing.

Mathematical problems and formulas are often expressed ______.

A recursive definition without a base-case will lead to ______.

Any recursive definition must have a nonrecursive part, called the base case, which permits the recursion to eventually end.

A careful trace of recursive processing can provide insight into the way it is used to solve a problem.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

Each recursive call to a method creates new and .