Question 1

In a quicksort algorithm, the middle of an array is called the ____________________.

Accepted Answer

The answer of In a quicksort algorithm, the middle of...

Question 2

sum(n) =1+2+3+...+n, 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 3

The ____ search algorithm is O(log n).

Accepted Answer

A)  binary 
B)  linear 
C)  recursive 
D)  iterative 
A)  binary 
B)  linear 
C)  recursive 
D)  iterative

Question 4

____ is an extra array used during the merge process.

Accepted Answer

A)  mergeSortHelper 
B)  tempSpace 
C)  copyBuffer 
D)  mergeBuffer 
A)  mergeSortHelper 
B)  tempSpace 
C)  copyBuffer 
D)  mergeBuffer

Question 5

Recursion and iteration can never be used in place of each other.

Accepted Answer

A) True 
 B)False

Question 6

Recursion is measured by looking at how the run time and memory usage of an algorithm vary as a function of the quantity of data processed.

Accepted Answer

A) True 
 B)False

Question 7

Identify the letter of the choice that best matches the phrase or definition.
a.Activation record
b.Stack
c.Quadratic
d.Exponential
e.copyBuffer
-During the merge sort process, smaller items are copied to here.

Accepted Answer

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

In a quicksort algorithm, the middle of an array is called the ____________________.

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

The ____ search algorithm is O(log n).

____ is an extra array used during the merge process.

Recursion and iteration can never be used in place of each other.

Recursion is measured by looking at how the run time and memory usage of an algorithm vary as a function of the quantity of data processed.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -During the merge sort process, smaller items are copied to here.

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 middle of an array is called the ____________________.

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

The ____ search algorithm is O(log n).

____ is an extra array used during the merge process.

Recursion and iteration can never be used in place of each other.

Recursion is measured by looking at how the run time and memory usage of an algorithm vary as a function of the quantity of data processed.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -During the merge sort process, smaller items are copied to here.

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