Question 1

The stack is a ________________ data structure.

Accepted Answer

A) first in - first out 
B) last in - last out 
C) last in - first out 
D) none of the above 
A) first in - first out 
B) last in - last out 
C) last in - first out 
D) none of the above

Question 2

What are the criteria you must consider when formulating a recursive solution?

Accepted Answer

When formulating a recursive solution,yo

Question 3

The order of magnitude of the binary search algorithm is:

Accepted Answer

A) linear 
B) exponential 
C) logarithmic 
D) quadratic 
A) linear 
B) exponential 
C) logarithmic 
D) quadratic

Question 4

What are two factors that contribute to the inefficiency of some recursive solutions?

Accepted Answer

One factor that contributes to the ineff

Question 5

A stack is a last-in/first-out memory structure.

Accepted Answer

A) True 
 B)False

Question 6

What is a base case?

Accepted Answer

A base case is a spe

Question 7

Recursion is:

Accepted Answer

A) the ability of a program to repeat a block of code 
B) the ability of a method to call itself 
C) the ability of a method to call smaller methods 
D) the ability of a method to implement factorials 
A) the ability of a program to repeat a block of code 
B) the ability of a method to call itself 
C) the ability of a method to call smaller methods 
D) the ability of a method to implement factorials

Question 8

To keep track of recursion most computer systems us a structure called a queue.

Accepted Answer

A) True 
 B)False

Question 9

Infinite recursion:

Accepted Answer

A) will happen when there is no base case 
B) will not happen when there is a base case 
C) will not happen if we use subproblems 
D) none of the above 
A) will happen when there is no base case 
B) will not happen when there is a base case 
C) will not happen if we use subproblems 
D) none of the above

Question 10

All recursive methods must have a/an:

Accepted Answer

A) starting case 
B) intermediate case 
C) stopping case 
D) none of the above 
A) starting case 
B) intermediate case 
C) stopping case 
D) none of the above

Question 11

Explain the concept of divide and conquer.

Accepted Answer

Divide and conquer is a simple

Question 12

A base case must include a recursive call.

Accepted Answer

A) True 
 B)False

Question 13

The binary search algorithm has worst-case running time that is logarithmic.

Accepted Answer

A) True 
 B)False

Question 14

Write an iterative method to print a string backwards.

Accepted Answer

public static void iterativeBa

Question 15

Explain how the binary search works.

Accepted Answer

Binary search works on arrays that are o

Question 16

A method definition that includes a call to itself is said to be recursive.

Accepted Answer

A) True 
 B)False

Question 17

During recursion,if the stack attempts to grow beyond its limit,a _____________ occurs.

Accepted Answer

A) Stack underflow 
B) Stack overflow 
C) Recursive underflow 
D) Recursive overflow 
A) Stack underflow 
B) Stack overflow 
C) Recursive underflow 
D) Recursive overflow

Question 18

When a recursive call is encountered,computation is temporarily suspended;all of the information needed to continue the computation is saved and the recursive call is evaluated.

Accepted Answer

A) True 
 B)False

Question 19

When defining recursive void methods you should:

Accepted Answer

A) Ensure there is no infinite recursion. 
B) Ensure that each stopping case performs the correct action for that case. 
C) Ensure that if all recursive calls perform their actions correctly,then the entire case performs correctly. 
D) All of the above 
A) Ensure there is no infinite recursion. 
B) Ensure that each stopping case performs the correct action for that case. 
C) Ensure that if all recursive calls perform their actions correctly,then the entire case performs correctly. 
D) All of the above

Question 20

Regarding recursion,if a base case is never reached the result is:

Accepted Answer

A) infinite recursion 
B) iteration 
C) termination 
D) all of the above 
A) infinite recursion 
B) iteration 
C) termination 
D) all of the above

The stack is a ________________ data structure.

What are the criteria you must consider when formulating a recursive solution?

The order of magnitude of the binary search algorithm is:

What are two factors that contribute to the inefficiency of some recursive solutions?

A stack is a last-in/first-out memory structure.

What is a base case?

Recursion is:

To keep track of recursion most computer systems us a structure called a queue.

Infinite recursion:

All recursive methods must have a/an:

Explain the concept of divide and conquer.

A base case must include a recursive call.

The binary search algorithm has worst-case running time that is logarithmic.

Write an iterative method to print a string backwards.

Explain how the binary search works.

A method definition that includes a call to itself is said to be recursive.

During recursion,if the stack attempts to grow beyond its limit,a _____________ occurs.

When a recursive call is encountered,computation is temporarily suspended;all of the information needed to continue the computation is saved and the recursive call is evaluated.

When defining recursive void methods you should:

Regarding recursion,if a base case is never reached the result is:

Getting Started

Console Input and Output

Flow of Control

Defining Classes I

Defining Classes II

Arrays

Inheritance

Polymorphism and Abstract Classes

Exception Handling

File IO

Uml and Patterns

Interfaces and Inner Classes

Generics and the Arraylist Class

Linked Data Structures

Collections,maps,and Iterators

Swing I

Swing II

Java Never Ends

Applets

Filters

Exam 11: Recursion

The stack is a ________________ data structure.

What are the criteria you must consider when formulating a recursive solution?

The order of magnitude of the binary search algorithm is:

What are two factors that contribute to the inefficiency of some recursive solutions?

A stack is a last-in/first-out memory structure.

What is a base case?

Recursion is:

To keep track of recursion most computer systems us a structure called a queue.

Infinite recursion:

All recursive methods must have a/an:

Explain the concept of divide and conquer.

A base case must include a recursive call.

The binary search algorithm has worst-case running time that is logarithmic.

Write an iterative method to print a string backwards.

Explain how the binary search works.

A method definition that includes a call to itself is said to be recursive.

During recursion,if the stack attempts to grow beyond its limit,a _____________ occurs.

When a recursive call is encountered,computation is temporarily suspended;all of the information needed to continue the computation is saved and the recursive call is evaluated.

When defining recursive void methods you should:

Regarding recursion,if a base case is never reached the result is:

Getting Started

Console Input and Output

Flow of Control

Defining Classes I

Defining Classes II

Arrays

Inheritance

Polymorphism and Abstract Classes

Exception Handling

File IO

Uml and Patterns

Interfaces and Inner Classes

Generics and the Arraylist Class

Linked Data Structures

Collections,maps,and Iterators

Swing I

Swing II

Java Never Ends

Applets

Filters