Question 1

An algorithm's time requirements can be derived as a function of the problem size.

Accepted Answer

A) True 
 B)False  True

Question 2

Suppose we wish to sort an array of 3-digit integers using radix sort.We will make three passes over the elements of the array.What occurs during the first pass?

Accepted Answer

The elements are sorted according to their 1's (rightmost)digit.

Question 3

In the worst case,how many comparisons are required in the bubble sort?

Accepted Answer

In the worst case,the bubble sort requires n * (n - 1)/2 comparisons.

Question 4

The value of which of the following growth-rate functions grows the slowest?

Accepted Answer

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

Question 5

The recursive binary search algorithm is a logarithmic algorithm.

Accepted Answer

A) True 
 B)False

Question 6

What is measured by an algorithm's growth rate?

Accepted Answer

An algorithm's growth rate mea

Question 7

In the best case,a sequential search is ______.

Accepted Answer

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

Question 8

If a problem of size n requires time that is directly proportional to n,the problem is ______.

Accepted Answer

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

Question 9

What measurements are parts of a program's efficiency?

Accepted Answer

The amount of comput

Question 10

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 ______ write operations.

Accepted Answer

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

Question 11

In the worst case,a binary search is ______.

Accepted Answer

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

Question 12

What is determined by worst-case analysis?

Accepted Answer

Worst-case analysis determines

Question 13

An algorithm's execution time is related to the number of ______ it requires.

Accepted Answer

A) parameters 
B) test data sets 
C) data fields 
D) operations 
A) parameters 
B) test data sets 
C) data fields 
D) operations

Question 14

For large arrays,the insertion sort is prohibitively inefficient.

Accepted Answer

A) True 
 B)False

Question 15

What does the area analysis of algorithms focus on?

Accepted Answer

Analysis of algorithms is the

Question 16

Which of the following is NOT part of the human cost of developing a computer program?

Accepted Answer

A) the efficiency of a program 
B) the readability of a program 
C) the modifiability of a program 
D) the maintainability a program 
A) the efficiency of a program 
B) the readability of a program 
C) the modifiability of a program 
D) the maintainability a program

Question 17

What is determined by average-case analysis?

Accepted Answer

Average-case analysis determin

Question 18

What is the drawback of the mergesort with respect to storage?

Accepted Answer

The mergesort requires an auxiliary arra

Question 19

Each merge step of the mergesort requires ______ major operations.

Accepted Answer

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

Question 20

The quicksort is ______ in the worst case.

Accepted Answer

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

An algorithm's time requirements can be derived as a function of the problem size.

Suppose we wish to sort an array of 3-digit integers using radix sort.We will make three passes over the elements of the array.What occurs during the first pass?

In the worst case,how many comparisons are required in the bubble sort?

The value of which of the following growth-rate functions grows the slowest?

The recursive binary search algorithm is a logarithmic algorithm.

What is measured by an algorithm's growth rate?

In the best case,a sequential search is ______.

If a problem of size n requires time that is directly proportional to n,the problem is ______.

What measurements are parts of a program's efficiency?

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 ______ write operations.

In the worst case,a binary search is ______.

What is determined by worst-case analysis?

An algorithm's execution time is related to the number of ______ it requires.

For large arrays,the insertion sort is prohibitively inefficient.

What does the area analysis of algorithms focus on?

Which of the following is NOT part of the human cost of developing a computer program?

What is determined by average-case analysis?

What is the drawback of the mergesort with respect to storage?

Each merge step of the mergesort requires ______ major operations.

The quicksort is ______ in the worst case.

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

An algorithm's time requirements can be derived as a function of the problem size.

Suppose we wish to sort an array of 3-digit integers using radix sort.We will make three passes over the elements of the array.What occurs during the first pass?

In the worst case,how many comparisons are required in the bubble sort?

The value of which of the following growth-rate functions grows the slowest?

The recursive binary search algorithm is a logarithmic algorithm.

What is measured by an algorithm's growth rate?

In the best case,a sequential search is ______.

If a problem of size n requires time that is directly proportional to n,the problem is ______.

What measurements are parts of a program's efficiency?

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 ______ write operations.

In the worst case,a binary search is ______.

What is determined by worst-case analysis?

An algorithm's execution time is related to the number of ______ it requires.

For large arrays,the insertion sort is prohibitively inefficient.

What does the area analysis of algorithms focus on?

Which of the following is NOT part of the human cost of developing a computer program?

What is determined by average-case analysis?

What is the drawback of the mergesort with respect to storage?

Each merge step of the mergesort requires ______ major operations.

The quicksort is ______ in the worst case.

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