Deck 7: Iterators

Question 1

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

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

Answer 1

base case

Question 2

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

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

Answer 2

method

Question 3

____________ problems and formulas are often expressed recursively.

A) Business
B) Programmatic
C) Variable
D) Mathematical

Answer 3

Mathematical

Question 4

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

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

Question 5

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

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

Question 6

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

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

Question 7

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

A) programmatic
B) variable
C) iterative
D) interface

Question 8

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

A) quadratic
B) linear
C) exponential
D) none of the above

Question 9

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

Question 10

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

Question 11

Mathematical problems and formulas are often expressed ______.

Question 12

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

Question 13

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

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

Mathematical problems and formulas are never expressed recursively.

Question 21

Each recursive call to a method uses the same local variables and parameters.

Question 22

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

Question 23

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

Question 24

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

Question 25

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

Question 26

One of the reasons recursion is so elegant and effective is that it creates a new set of local variables and parameters with each call.

Question 27

What is the output of the following program?

Question 28

What is infinite recursion?

Question 29

When is a base case needed for recursive processing?

Question 30

When should recursion be avoided?

Question 31

What is indirect recursion?

Question 32

Explain the general approach to solving the Towers of Hanoi puzzle. How does it relate to recursion?