Question 1

The selection sort is continued until ______ of the n items in an array have been swapped.

Accepted Answer

A) n/2 
B) n - 2 
C) n - 1 
D) n 
A) n/2 
B) n - 2 
C) n - 1 
D) n

Question 2

Which of the following can be used to compare two algorithms?

Accepted Answer

A) growth rates of the two algorithms 
B) implementations of the two algorithms 
C) test data used to test programs which implement the two algorithms 
D) computers on which programs which implement the two algorithms are run 
A) growth rates of the two algorithms 
B) implementations of the two algorithms 
C) test data used to test programs which implement the two algorithms 
D) computers on which programs which implement the two algorithms are run

Question 3

How does the quicksort partition an array?

Accepted Answer

The quicksort partitions an ar

Question 4

Algorithm efficiency is typically a concern for ______.

Accepted Answer

A) small problems only 
B) large problems only 
C) medium sized problems only 
D) problems of all sizes 
A) small problems only 
B) large problems only 
C) medium sized problems only 
D) problems of all sizes

Question 5

In the worst case,the insertion sort's comparison occurs ______ times.

Accepted Answer

A) n 
B) n - 1 
C) (n - 1)/ 2 
D) n * (n - 1)/2 
A) n 
B) n - 1 
C) (n - 1)/ 2 
D) n * (n - 1)/2

Question 6

An exponential algorithm has the growth-rate function ______.

Accepted Answer

A) O(n²) 
B) O(n³) 
C) O(2ⁿ) 
D) O(log2ⁿ) 
A) O(n²) 
B) O(n³) 
C) O(2ⁿ) 
D) O(log2ⁿ)

Question 7

When choosing between two algorithms,under what conditions can the efficiencies of the algorithms be ignored?

Accepted Answer

The efficiencies of

Question 8

The values of the growth-rate function O(log2ⁿ)grow faster than the values of the growth-rate function O(n).

Accepted Answer

A) True 
 B)False

Question 9

According to the following statements:
Algorithm A requires time proportional to n
Algorithm B requires time proportional to n2
algorithm B's time requirement - as a function of the problem size n - increases at a slower rate than algorithm A's time requirement.

Accepted Answer

A) True 
 B)False

Question 10

A linear algorithm has the growth-rate function ______.

Accepted Answer

A) O(log2ⁿ) 
B) O(2ⁿ) 
C) O(n) 
D) O(1) 
A) O(log2ⁿ) 
B) O(2ⁿ) 
C) O(n) 
D) O(1)

Question 11

Consider an algorithm that contains loops of the form: for (x = 1 through n ){
For (y = 1 through x){
For (z = 1 through 10){
Task T
} // end for
} // end for
} // end for
If task T requires t time units,the loop on y requires ______ time units.

Accepted Answer

A) 10 * t 
B) (10 * t)+ x 
C) 10 * t * x 
D) t * x 
A) 10 * t 
B) (10 * t)+ x 
C) 10 * t * x 
D) t * x

Question 12

List the three factors which can cloud the comparison of algorithms performed by implementing the algorithms in Java and running the programs.

Accepted Answer

The three factors are differen

Question 13

Compare the efficiencies of the quicksort and the mergesort in the worst case.

Accepted Answer

In the worst case,the quicksor

Question 14

A quadratic algorithm has the growth-rate function ______.

Accepted Answer

A) O(n²) 
B) O(n³) 
C) O(2ⁿ) 
D) O(log2ⁿ) 
A) O(n²) 
B) O(n³) 
C) O(2ⁿ) 
D) O(log2ⁿ)

Question 15

What is the sort key of a record?

Accepted Answer

The sort key is the part of a record tha

Question 16

Algorithm analysis should be independent of all of the following EXCEPT ______.

Accepted Answer

A) the programming style used in the implementation of the algorithm 
B) the computer used to run a program which implements an algorithm 
C) the number of significant operations in an algorithm 
D) the test data used to test a program which implements an algorithm 
A) the programming style used in the implementation of the algorithm 
B) the computer used to run a program which implements an algorithm 
C) the number of significant operations in an algorithm 
D) the test data used to test a program which implements an algorithm

Question 17

The ______ compares adjacent items and exchanges them if they are out of order.

Accepted Answer

A) selection sort 
B) binary search 
C) bubble sort 
D) quicksort 
A) selection sort 
B) binary search 
C) bubble sort 
D) quicksort

Question 18

Assuming a linked list of n nodes,the code fragment: Node curr = head;
While (curr != null){
System.out.println(curr.getItem());
Curr.setNext(curr.getNext());
} // end while
Requires ______ assignments.

Accepted Answer

A) n 
B) n - 1 
C) n + 1 
D) 1 
A) n 
B) n - 1 
C) n + 1 
D) 1

Question 19

Consider the following nested loop.What is the order of the algorithm?
for (int i = 0;i < n;++i)
for (j = 1;j < n;j *= 2)
…

Accepted Answer

The answer of Consider the following nested loop.What is the...

Question 20

Which of the following growth-rate functions indicates a problem whose time requirement is independent of the size of the problem?

Accepted Answer

A) O(n) 
B) O(log2ⁿ) 
C) O(2ⁿ) 
D) O(1) 
A) O(n) 
B) O(log2ⁿ) 
C) O(2ⁿ) 
D) O(1)

The selection sort is continued until ______ of the n items in an array have been swapped.

Which of the following can be used to compare two algorithms?

How does the quicksort partition an array?

Algorithm efficiency is typically a concern for ______.

In the worst case,the insertion sort's comparison occurs ______ times.

An exponential algorithm has the growth-rate function ______.

When choosing between two algorithms,under what conditions can the efficiencies of the algorithms be ignored?

The values of the growth-rate function O(log2ⁿ)grow faster than the values of the growth-rate function O(n).

According to the following statements: Algorithm A requires time proportional to n Algorithm B requires time proportional to n² algorithm B's time requirement - as a function of the problem size n - increases at a slower rate than algorithm A's time requirement.

A linear algorithm has the growth-rate function ______.

Consider an algorithm that contains loops of the form: for (x = 1 through n ){ For (y = 1 through x){ For (z = 1 through 10){ Task T } // end for } // end for } // end for If task T requires t time units,the loop on y requires ______ time units.

List the three factors which can cloud the comparison of algorithms performed by implementing the algorithms in Java and running the programs.

Compare the efficiencies of the quicksort and the mergesort in the worst case.

A quadratic algorithm has the growth-rate function ______.

What is the sort key of a record?

Algorithm analysis should be independent of all of the following EXCEPT ______.

The ______ compares adjacent items and exchanges them if they are out of order.

Assuming a linked list of n nodes,the code fragment: Node curr = head; While (curr != null){ System.out.println(curr.getItem()); Curr.setNext(curr.getNext()); } // end while Requires ______ assignments.

Consider the following nested loop.What is the order of the algorithm? for (int i = 0;i < n;++i) for (j = 1;j < n;j *= 2) …

Which of the following growth-rate functions indicates a problem whose time requirement is independent of the size of the problem?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 10: Algorithm Efficiency and Sorting

The selection sort is continued until ______ of the n items in an array have been swapped.

Which of the following can be used to compare two algorithms?

How does the quicksort partition an array?

Algorithm efficiency is typically a concern for ______.

In the worst case,the insertion sort's comparison occurs ______ times.

An exponential algorithm has the growth-rate function ______.

When choosing between two algorithms,under what conditions can the efficiencies of the algorithms be ignored?

The values of the growth-rate function O(log2ⁿ)grow faster than the values of the growth-rate function O(n).

According to the following statements: Algorithm A requires time proportional to n Algorithm B requires time proportional to n2 algorithm B's time requirement - as a function of the problem size n - increases at a slower rate than algorithm A's time requirement.

A linear algorithm has the growth-rate function ______.

Consider an algorithm that contains loops of the form: for (x = 1 through n ){ For (y = 1 through x){ For (z = 1 through 10){ Task T } // end for } // end for } // end for If task T requires t time units,the loop on y requires ______ time units.

List the three factors which can cloud the comparison of algorithms performed by implementing the algorithms in Java and running the programs.

Compare the efficiencies of the quicksort and the mergesort in the worst case.

A quadratic algorithm has the growth-rate function ______.

What is the sort key of a record?

Algorithm analysis should be independent of all of the following EXCEPT ______.

The ______ compares adjacent items and exchanges them if they are out of order.

Assuming a linked list of n nodes,the code fragment: Node curr = head; While (curr != null){ System.out.println(curr.getItem()); Curr.setNext(curr.getNext()); } // end while Requires ______ assignments.

Consider the following nested loop.What is the order of the algorithm? for (int i = 0;i < n;++i) for (j = 1;j < n;j *= 2) …

Which of the following growth-rate functions indicates a problem whose time requirement is independent of the size of the problem?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

According to the following statements: Algorithm A requires time proportional to n Algorithm B requires time proportional to n² algorithm B's time requirement - as a function of the problem size n - increases at a slower rate than algorithm A's time requirement.