Question 1

Suppose sa is a sorted array of integer values,and we wish to search for a number target in this array.If sa contains n elements,and we use the binary search strategy,what is the approximate maximum number of comparisons necessary to determine that the value target is or is not in the array? How would your answer change if the array were not sorted?

Accepted Answer

The answer of Suppose sa is a sorted array of...

Question 2

Which of the following is NOT a precondition for an array that is to be sorted by a recursive binary search algorithm? (first is the index of the first item in the array,last is the index of the last item in the array,and SIZE is the maximum size of the array)

Accepted Answer

A) SIZE <= first 
B) 0 <= first 
C) last <= SIZE - 1 
D) anArray[first] <= anArray[first + 1] <= … <= anArray[last]

Question 3

What is an activation record?

Accepted Answer

The answer of What is an activation record?...

Question 4

When constructing a recursive solution,you should assume that a recursive call's postcondition is true if its precondition is true.

Accepted Answer

A) True 
 B)False

Question 5

In the box trace,each box roughly corresponds to a(n)______.

Accepted Answer

A) recursive relation 
B) activation record 
C) base case 
D) pivot item

Question 6

In the box trace,each box contains all of the following EXCEPT ______.

Accepted Answer

A) the values of the references and primitive types of the method's arguments 
B) the method's local variables 
C) the method's class variables 
D) a placeholder for the value returned by each recursive call from the current box 
E) the value of the method itself

Question 7

What are the four questions that must be considered when constructing a recursive solution?

Accepted Answer

The answer of What are the four questions that must...

Question 8

The base case for a recursive definition of the factorial of n is ______.

Accepted Answer

A) factorial (-1) 
B) factorial (0) 
C) factorial (1) 
D) factorial (n - 1)

Question 9

Why do some compilers automatically replace tail recursion with iteration?

Accepted Answer

The answer of Why do some compilers automatically replace tail...

Question 10

When you solve a problem by solving two or more smaller problems,each of the smaller problems must be ______ the base case than the original problem.

Accepted Answer

A) closer to 
B) farther to 
C) either closer to or the same "distance" from 
D) either farther to or the same "distance" from

Question 11

The factorial of zero is ______.

Accepted Answer

A) -1 
B) 0 
C) 1 
D) 2

Question 12

The base case for a recursive solution to the kth smallest item problem cannot be predicted in advance.

Accepted Answer

A) True 
 B)False

Question 13

The binary search algorithm can be applied to an unsorted array.

Accepted Answer

A) True 
 B)False

Question 14

When is the base case first > last (where first is the index of the first item in the array and last is the index of the last item in the array)reached in a recursive binary search algorithm?

Accepted Answer

The answer of When is the base case first >...

Question 15

An array is a(n)______.

Accepted Answer

A) class 
B) method 
C) object 
D) variable

Question 16

Write a recursive method that takes a String parameter and prints out the characters of the string in reverse order.

Accepted Answer

The answer of Write a recursive method that takes a...

Question 17

Every recursive method must have a base case.

Accepted Answer

A) True 
 B)False

Question 18

How many bases cases will be required in a recursive solution that solves a problem by solving two smaller problems of the same type?

Accepted Answer

A) 0 
B) 1 
C) 2 
D) 3

Question 19

If the value being searched for by a recursive binary search algorithm is in the array,which of the following is true?

Accepted Answer

A) the algorithm cannot return a nonpositive number 
B) the algorithm cannot return a nonnegative number 
C) the algorithm cannot return a zero 
D) the algorithm cannot return a negative number

Question 20

A method that is declared as static is an object method.

Accepted Answer

A) True 
 B)False

Exam 3: Recursion: the Mirrors

Which of the following is NOT a precondition for an array that is to be sorted by a recursive binary search algorithm? (first is the index of the first item in the array,last is the index of the last item in the array,and SIZE is the maximum size of the array)

What is an activation record?

When constructing a recursive solution,you should assume that a recursive call's postcondition is true if its precondition is true.

In the box trace,each box roughly corresponds to a(n) ______.

In the box trace,each box contains all of the following EXCEPT ______.

What are the four questions that must be considered when constructing a recursive solution?

The base case for a recursive definition of the factorial of n is ______.

Why do some compilers automatically replace tail recursion with iteration?

When you solve a problem by solving two or more smaller problems,each of the smaller problems must be ______ the base case than the original problem.

The factorial of zero is ______.

The base case for a recursive solution to the kth smallest item problem cannot be predicted in advance.

The binary search algorithm can be applied to an unsorted array.

When is the base case first > last (where first is the index of the first item in the array and last is the index of the last item in the array)reached in a recursive binary search algorithm?

An array is a(n) ______.

Write a recursive method that takes a String parameter and prints out the characters of the string in reverse order.

Every recursive method must have a base case.

How many bases cases will be required in a recursive solution that solves a problem by solving two smaller problems of the same type?

If the value being searched for by a recursive binary search algorithm is in the array,which of the following is true?

A method that is declared as static is an object method.