Question 1

Write a recursive method to compute the factorial of a number.

Accepted Answer

public static int factorialint n)
{
ifn < 0)
{
System.out.println"Sorry negative numbers not allowed.");
System.exit0);
}
ifn == 1)//base case
return1);
else
return n * factorialn-1));
}

Question 2

The underlying data structure used by the computer during recursion is a:

Accepted Answer

A) queue 
B) linked list 
C) tree 
D) stack 
A) queue 
B) linked list 
C) tree 
D) stack D

Question 3

Write a recursive method to compute the power of xn for non-negative n.

Accepted Answer

public static int powerint x,int n)
{
ifn < 0)
{
System.out.println"Illegal argument to power");
System.exit0);
}
ifn > 0)
return powerx,n-1)* x);
else
return1);//base case
}

Question 4

The binary search algorithm is extremely slow compared to an algorithm that simply tries all array elements in order.

Accepted Answer

A) True 
 B)False

Question 5

The following code for the method factorial)applies to the next two questions: public static double factorial double n)
{
If n == 0)
{
Return 1;
}
Else
{
Return n * factorialn-1);
}
}
What is the value returned when the integer 3 is the argument to the factorial method?

Accepted Answer

A) 2 
B) 4 
C) 6 
D) 8 
A) 2 
B) 4 
C) 6 
D) 8

Question 6

How does the computer system handle a recursive method call?

Accepted Answer

When the computer encounters a recursive

Question 7

A recursive solution can be preferable to an iterative solution because:

Accepted Answer

A) recursive method calls are faster than iterative looping 
B) recursive solutions may be easier to understand than iterative ones 
C) recursion uses less memory than iteration 
D) iteration should be avoided. 
A) recursive method calls are faster than iterative looping 
B) recursive solutions may be easier to understand than iterative ones 
C) recursion uses less memory than iteration 
D) iteration should be avoided.

Question 8

A recursively written method will usually run slower and use more storage than an equivalent iterative version.

Accepted Answer

A) True 
 B)False

Question 9

What are the two base cases for a recursive binary search algorithm?

Accepted Answer

One base case for the recursive binary s

Question 10

When defining recursive valued methods you should:

Accepted Answer

A) Ensure there is no infinite recursion. 
B) Ensure each stopping case returns the correct value for that case. 
C) Ensure that the final value returned by the method is the correct value. 
D) All of the above 
A) Ensure there is no infinite recursion. 
B) Ensure each stopping case returns the correct value for that case. 
C) Ensure that the final value returned by the method is the correct value. 
D) All of the above

Question 11

Write an iterative method to compute the power of xn for non-negative n.

Accepted Answer

public static int iterativePowerint x,in

Question 12

Activation records are used to implement recursion.

Accepted Answer

A) True 
 B)False

Question 13

Binary search is a divide and conquer algorithm.

Accepted Answer

A) True 
 B)False

Question 14

What is the value returned when the integer 5 is the argument to the factorial method?

Accepted Answer

A) 15 
B) 50 
C) 100 
D) 120 
A) 15 
B) 50 
C) 100 
D) 120

Question 15

What is an activation record?

Accepted Answer

An activation record

Question 16

The portion of memory in which a recursive computation is stored is called a/an:

Accepted Answer

A) stack frame 
B) activation record 
C) all of the above 
D) none of the above 
A) stack frame 
B) activation record 
C) all of the above 
D) none of the above

Question 17

What is a stack overflow?

Accepted Answer

A stack overflow is an error c

Question 18

Write an iterative method to compute the factorial of a number.

Accepted Answer

public static int iterativeFactorialint

Question 19

Write a recursive method to print a string backwards.

Accepted Answer

public static void writeBackwa

Question 20

Explain how a sequential search works.

Accepted Answer

A sequential search works by e

Write a recursive method to compute the factorial of a number.

The underlying data structure used by the computer during recursion is a:

Write a recursive method to compute the power of x< sup >n< /sup > for non-negative n.

The binary search algorithm is extremely slow compared to an algorithm that simply tries all array elements in order.

The following code for the method factorial)applies to the next two questions: public static double factorial double n) { If n == 0) { Return 1; } Else { Return n * factorialn-1); } } What is the value returned when the integer 3 is the argument to the factorial method?

How does the computer system handle a recursive method call?

A recursive solution can be preferable to an iterative solution because:

A recursively written method will usually run slower and use more storage than an equivalent iterative version.

What are the two base cases for a recursive binary search algorithm?

When defining recursive valued methods you should:

Write an iterative method to compute the power of x< sup >n< /sup > for non-negative n.

Activation records are used to implement recursion.

Binary search is a divide and conquer algorithm.

What is the value returned when the integer 5 is the argument to the factorial method?

What is an activation record?

The portion of memory in which a recursive computation is stored is called a/an:

What is a stack overflow?

Write an iterative method to compute the factorial of a number.

Write a recursive method to print a string backwards.

Explain how a sequential search works.

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

Write a recursive method to compute the factorial of a number.

The underlying data structure used by the computer during recursion is a:

Write a recursive method to compute the power of x< sup >n< /sup > for non-negative n.

The binary search algorithm is extremely slow compared to an algorithm that simply tries all array elements in order.

The following code for the method factorial)applies to the next two questions: public static double factorial double n) { If n == 0) { Return 1; } Else { Return n * factorialn-1); } } What is the value returned when the integer 3 is the argument to the factorial method?

How does the computer system handle a recursive method call?

A recursive solution can be preferable to an iterative solution because:

A recursively written method will usually run slower and use more storage than an equivalent iterative version.

What are the two base cases for a recursive binary search algorithm?

When defining recursive valued methods you should:

Write an iterative method to compute the power of x< sup >n< /sup > for non-negative n.

Activation records are used to implement recursion.

Binary search is a divide and conquer algorithm.

What is the value returned when the integer 5 is the argument to the factorial method?

What is an activation record?

The portion of memory in which a recursive computation is stored is called a/an:

What is a stack overflow?

Write an iterative method to compute the factorial of a number.

Write a recursive method to print a string backwards.

Explain how a sequential search works.

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