Question 1

What is an external sort?

Accepted Answer

An external sort is a sorting

Question 2

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

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 3

Suppose we have three algorithms,and their orders are O(n²),O(2ⁿ)and O(log2 n).Arrange these orders in increasing magnitude.

Accepted Answer

O(log₂ n)<

Question 4

If an algorithm requires 2ⁿ³ + 17n² + 54n + 512 operations to perform,where n is the size of the input data,then we say the order of the algorithm is O(_____).

Accepted Answer

The answer of If an algorithm requires 2ⁿ³ + 17n²...

Question 5

The analysis of an algorithm must take into consideration the computer that will be used to run a program that implements the algorithm.

Accepted Answer

A) True 
 B)False

Question 6

The efficiency of the selection sort depends on the initial arrangement of the data.

Accepted Answer

A) True 
 B)False

Question 7

Given the following array: 4 15 8 3 28 21
Which of the following represents the array after the second swap of the selection sort?

Accepted Answer

A) 4 3 8 15 21 28 
B) 4 15 8 3 21 28 
C) 3 4 8 15 21 28 
D) 21 4 3 8 15 28 
A) 4 3 8 15 21 28 
B) 4 15 8 3 21 28 
C) 3 4 8 15 21 28 
D) 21 4 3 8 15 28

Question 8

Given the fact that a selection sort of n items requires n²/2 + 5 * n/2 - 3 major operations,the selection sort is ______.

Accepted Answer

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

Question 9

What is an internal sort?

Accepted Answer

An internal sort is a sorting

Question 10

A bubble sort requires at most ______ passes to sort an array of n items.

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 11

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 ______ comparisons.

Accepted Answer

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

Question 12

The solution to the Towers of Hanoi problem with n disks requires 2ⁿ - 1 moves.If each move requires the same time m,the solution requires ______ time units.

Accepted Answer

A) 2ⁿ - 1 
B) (2ⁿ - 1)+ m 
C) (2ⁿ - 1)/ m 
D) (2ⁿ - 1)* m 
A) 2ⁿ - 1 
B) (2ⁿ - 1)+ m 
C) (2ⁿ - 1)/ m 
D) (2ⁿ - 1)* m

Question 13

The mergesort is a recursive sorting algorithm.

Accepted Answer

A) True 
 B)False

Question 14

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 innermost loop on z requires ______ time units.

Accepted Answer

A) y 
B) 10 
C) z * t 
D) 10 * t 
A) y 
B) 10 
C) z * t 
D) 10 * t

Question 15

Low-order terms can be ignored in an algorithm's growth-rate function.

Accepted Answer

A) True 
 B)False

Question 16

A growth-rate function of ______ implies a problem whose time requirement is constant.

Accepted Answer

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

Question 17

Given the statement: Algorithm A requires time proportional to f(n)
Algorithm A is said to be ______.

Accepted Answer

A) in class f(n) 
B) of degree f(n) 
C) order f(n) 
D) equivalent to f(n) 
A) in class f(n) 
B) of degree f(n) 
C) order f(n) 
D) equivalent to f(n)

Question 18

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

Accepted Answer

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

Question 19

What is a growth-rate function?

Accepted Answer

A growth-rate function is a ma

Question 20

To sort numeric data,the radix sort treats a number as a character string.

Accepted Answer

A) True 
 B)False

What is an external sort?

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

Suppose we have three algorithms,and their orders are O(n²),O(2ⁿ)and O(log2 n).Arrange these orders in increasing magnitude.

If an algorithm requires 2ⁿ³ + 17n² + 54n + 512 operations to perform,where n is the size of the input data,then we say the order of the algorithm is O(_____).

The analysis of an algorithm must take into consideration the computer that will be used to run a program that implements the algorithm.

The efficiency of the selection sort depends on the initial arrangement of the data.

Given the following array: 4 15 8 3 28 21 Which of the following represents the array after the second swap of the selection sort?

Given the fact that a selection sort of n items requires n²/2 + 5 * n/2 - 3 major operations,the selection sort is ______.

What is an internal sort?

A bubble sort requires at most ______ passes to sort an array of n items.

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 ______ comparisons.

The solution to the Towers of Hanoi problem with n disks requires 2ⁿ - 1 moves.If each move requires the same time m,the solution requires ______ time units.

The mergesort is a recursive sorting algorithm.

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 innermost loop on z requires ______ time units.

Low-order terms can be ignored in an algorithm's growth-rate function.

A growth-rate function of ______ implies a problem whose time requirement is constant.

Given the statement: Algorithm A requires time proportional to f(n) Algorithm A is said to be ______.

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

What is a growth-rate function?

To sort numeric data,the radix sort treats a number as a character string.

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

What is an external sort?

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

Suppose we have three algorithms,and their orders are O(n²),O(2ⁿ)and O(log2 n).Arrange these orders in increasing magnitude.

If an algorithm requires 2ⁿ³ + 17n² + 54n + 512 operations to perform,where n is the size of the input data,then we say the order of the algorithm is O(_____).

The analysis of an algorithm must take into consideration the computer that will be used to run a program that implements the algorithm.

The efficiency of the selection sort depends on the initial arrangement of the data.

Given the following array: 4 15 8 3 28 21 Which of the following represents the array after the second swap of the selection sort?

Given the fact that a selection sort of n items requires n²/2 + 5 * n/2 - 3 major operations,the selection sort is ______.

What is an internal sort?

A bubble sort requires at most ______ passes to sort an array of n items.

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 ______ comparisons.

The solution to the Towers of Hanoi problem with n disks requires 2ⁿ - 1 moves.If each move requires the same time m,the solution requires ______ time units.

The mergesort is a recursive sorting algorithm.

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 innermost loop on z requires ______ time units.

Low-order terms can be ignored in an algorithm's growth-rate function.

A growth-rate function of ______ implies a problem whose time requirement is constant.

Given the statement: Algorithm A requires time proportional to f(n) Algorithm A is said to be ______.

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

What is a growth-rate function?

To sort numeric data,the radix sort treats a number as a character string.

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