Question 1

Binary search does ____ comparisons in the worst case.

Accepted Answer

A)  Θ(1) 
B)  Θ(lg n) 
C)  Θ(n) 
D)  Θ(n2)

Question 2

____ is the algorithmic equivalence of style.

Accepted Answer

A)  Efficiency 
B)  Elegance 
C)  Aesthetics 
D)  Complexity

Question 3

A surprising number of problems fall into the "____" category.

Accepted Answer

A)  suspected intractable 
B)  approximation algorithm 
C)  bin-packing 
D)  declared intractable

Question 4

____ involves the fixing of errors that are uncovered through repeated usage with different input values.

Accepted Answer

A)  Program maintenance 
B)  Recycling 
C)  Data cleanup 
D)  Garbage collection

Question 5

____ are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine.

Accepted Answer

A)  Time trials 
B)  Benchmarks 
C)  Comparison times 
D)  Intensive tests

Question 6

Discuss at length both the best and worst case of the pattern-matching algorithm.

Accepted Answer

The answer of Discuss at length both the best and...

Question 7

Given the data cleanup problem described in the text, write the pseudocode for the converging-pointers algorithm for data cleanup.

Accepted Answer

The answer of Given the data cleanup problem described in...

Question 8

Selection sort is a(n) ____ algorithm in all cases.

Accepted Answer

A)  Θ(1) 
B)  Θ(n) 
C)  Θ(2n) 
D)  Θ(n2)

Question 9

A collection of nodes and connecting edges is called a(n) vector._________________________

Accepted Answer

A) True 
 B)False

Question 10

How do you approach problems for which no known polynomial solution algorithm exists?

Accepted Answer

The answer of How do you approach problems for which...

Exam 3: The Efficiency of Algorithms