Question 1

In a quicksort algorithm, the iterative approach requires a data structure called a(n) ____.

Accepted Answer

A)  stack 
B)  merge 
C)  activation record 
D)  big-O 
A)  stack 
B)  merge 
C)  activation record 
D)  big-O

Question 2

Identify the letter of the choice that best matches the phrase or definition.
a.Activation record
b.Stack
c.Quadratic
d.Exponential
e.copyBuffer
-When a method returns, its activation record is removed from the top of the ____.

Accepted Answer

The answer of Identify the letter of the choice that...

Question 3

An algorithm is ____ if no work is done in the algorithm after a recursive call.

Accepted Answer

A)  complex 
B)  iterative 
C)  infinite 
D)  tail-recursive 
A)  complex 
B)  iterative 
C)  infinite 
D)  tail-recursive

Question 4

Identify the letter of the choice that best matches the phrase or definition.
a.Activation record
b.Stack
c.Quadratic
d.Exponential
e.copyBuffer
-The name of the big-O value O(n squared).

Accepted Answer

The answer of Identify the letter of the choice that...

Question 5

Because the summation algorithm must visit each number in the array, no matter how the numbers are ordered, the algorithm is always linear. ____________________

Accepted Answer

A) True 
 B)False

Question 6

FIGURE 13-2  
-Figure 13-2 above shows subarrays generated during calls of ____.

Accepted Answer

A)  quickSort 
B)  binarySort 
C)  mergeSort 
D)  bubbleSort 
A)  quickSort 
B)  binarySort 
C)  mergeSort 
D)  bubbleSort

Question 7

The big-O value O(1) is named logarithmic. ____________________

Accepted Answer

A) True 
 B)False

Question 8

The big-O value O(n) is named ____________________.

Accepted Answer

The answer of The big-O value O(n) is named ____________________....

Question 9

FIGURE 13-2  
-Leslie knows that the array will be sorted ____.

Accepted Answer

A)  if the tag at the left end of the array is greater than the tag at the right end of the array. 
B)  when the pivot is 0 
C)  when all of the subparts contain a single value 
D)  all of the above. 
A)  if the tag at the left end of the array is greater than the tag at the right end of the array. 
B)  when the pivot is 0 
C)  when all of the subparts contain a single value 
D)  all of the above.

Question 10

____________________ analysis is used to answer the question: what is the effect on the method of increasing the quantity of data processed?

Accepted Answer

The answer of ____________________ analysis is used to answer the...

Question 11

A recursive step, in which the method calls itself, must ____.

Accepted Answer

A)  include a call to the method 
B)  be tail-recursive 
C)  include a binary search algorithm 
D)  eventually lead to the stopping state 
A)  include a call to the method 
B)  be tail-recursive 
C)  include a binary search algorithm 
D)  eventually lead to the stopping state

Question 12

Given two methods that perform the same task, the one that is quadratic is preferable to the one that is linear.

Accepted Answer

A) True 
 B)False

Question 13

Jarrod knows that if the length of his list is 4 to 7, the maximum number of steps needed to do a binary search is ____.

Accepted Answer

A)  1 
B)  3 
C)  4 
D)  7 
A)  1 
B)  3 
C)  4 
D)  7

Question 14

sum(n) =n+sum(n-1), where n>1 is an example of a(n) ____ algorithm.

Accepted Answer

A)  recursive 
B)  iterative 
C)  complex 
D)  infinite 
A)  recursive 
B)  iterative 
C)  complex 
D)  infinite

Question 15

Given a recursive definition of some process, it is usually easy to write a recursive method that implements it.

Accepted Answer

A) True 
 B)False

Question 16

The logarithmic big-O value is ____.

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(log n) 
D)  O(n log n) 
A)  O(1) 
B)  O(n) 
C)  O(log n) 
D)  O(n log n)

Question 17

A ____ sort algorithm computes the middle position of an array and recursively sorts its left and right subarrays, merges to two sorted subarrays into a single sorted array, then stops when the subarrays can no longer be subdivided.

Accepted Answer

A)  stack 
B)  merge 
C)  quick 
D)  recursive 
A)  stack 
B)  merge 
C)  quick 
D)  recursive

Question 18

Identify the letter of the choice that best matches the phrase or definition.
a.Activation record
b.Stack
c.Quadratic
d.Exponential
e.copyBuffer
-Contains, among other things, the value returned by the method.

Accepted Answer

The answer of Identify the letter of the choice that...

Question 19

The constant big-O value is ____.

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(log n) 
D)  O(n log n) 
A)  O(1) 
B)  O(n) 
C)  O(log n) 
D)  O(n log n)

Question 20

A(n) ____ algorithm is one that refers to itself.

Accepted Answer

A)  recursive 
B)  iterative 
C)  complex 
D)  infinite 
A)  recursive 
B)  iterative 
C)  complex 
D)  infinite

In a quicksort algorithm, the iterative approach requires a data structure called a(n) ____.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -When a method returns, its activation record is removed from the top of the ____.

An algorithm is ____ if no work is done in the algorithm after a recursive call.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -The name of the big-O value O(n squared).

Because the summation algorithm must visit each number in the array, no matter how the numbers are ordered, the algorithm is always linear. ____________________

FIGURE 13-2 -Figure 13-2 above shows subarrays generated during calls of ____.

The big-O value O(1) is named logarithmic. ____________________

The big-O value O(n) is named ____________________.

FIGURE 13-2 -Leslie knows that the array will be sorted ____.

____________________ analysis is used to answer the question: what is the effect on the method of increasing the quantity of data processed?

A recursive step, in which the method calls itself, must ____.

Given two methods that perform the same task, the one that is quadratic is preferable to the one that is linear.

Jarrod knows that if the length of his list is 4 to 7, the maximum number of steps needed to do a binary search is ____.

sum(n) =n+sum(n-1), where n>1 is an example of a(n) ____ algorithm.

Given a recursive definition of some process, it is usually easy to write a recursive method that implements it.

The logarithmic big-O value is ____.

A ____ sort algorithm computes the middle position of an array and recursively sorts its left and right subarrays, merges to two sorted subarrays into a single sorted array, then stops when the subarrays can no longer be subdivided.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -Contains, among other things, the value returned by the method.

The constant big-O value is ____.

A(n) ____ algorithm is one that refers to itself.

Background

First Java Programs

Syntax, Errors, and Debugging

Introduction to Control Statements

Using Classes and Objects in Media Computing

Introduction to Defining Classes

Control Statements Continued

Improving the User Interface

Introduction to Html and Applets

Introduction to Arrays

Classes Continued

Arrays Continued

Introduction to Collections

Multithreading, Networks, Clientserver Programming

Filters

Exam 13: Recursion, Complexity, and Searching and Sorting

In a quicksort algorithm, the iterative approach requires a data structure called a(n) ____.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -When a method returns, its activation record is removed from the top of the ____.

An algorithm is ____ if no work is done in the algorithm after a recursive call.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -The name of the big-O value O(n squared).

Because the summation algorithm must visit each number in the array, no matter how the numbers are ordered, the algorithm is always linear. ____________________

FIGURE 13-2 -Figure 13-2 above shows subarrays generated during calls of ____.

The big-O value O(1) is named logarithmic. ____________________

The big-O value O(n) is named ____________________.

FIGURE 13-2 -Leslie knows that the array will be sorted ____.

____________________ analysis is used to answer the question: what is the effect on the method of increasing the quantity of data processed?

A recursive step, in which the method calls itself, must ____.

Given two methods that perform the same task, the one that is quadratic is preferable to the one that is linear.

Jarrod knows that if the length of his list is 4 to 7, the maximum number of steps needed to do a binary search is ____.

sum(n) =n+sum(n-1), where n>1 is an example of a(n) ____ algorithm.

Given a recursive definition of some process, it is usually easy to write a recursive method that implements it.

The logarithmic big-O value is ____.

A ____ sort algorithm computes the middle position of an array and recursively sorts its left and right subarrays, merges to two sorted subarrays into a single sorted array, then stops when the subarrays can no longer be subdivided.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -Contains, among other things, the value returned by the method.

The constant big-O value is ____.

A(n) ____ algorithm is one that refers to itself.

Background

First Java Programs

Syntax, Errors, and Debugging

Introduction to Control Statements

Using Classes and Objects in Media Computing

Introduction to Defining Classes

Control Statements Continued

Improving the User Interface

Introduction to Html and Applets

Introduction to Arrays

Classes Continued

Arrays Continued

Introduction to Collections

Multithreading, Networks, Clientserver Programming

Filters