Exam 3: The Efficiency of Algorithms

Part of the job of program ____ is to make clear any assumptions or restrictions about the input size the program was designed to handle.

The copy-over algorithm is ____ in time efficiency in the worst case.

____ is the term to describe an algorithm's careful use of resources.

The selection sort algorithm does exchanges, in addition to comparisons.

____ is the fixing of errors uncovered through repeated use of an algorithm.

The selection sort algorithm can recognize whether or not the list is already sorted at the beginning.

A ____ is a path through a graph that begins and ends on the same node and goes through every node exactly once.

The study of the efficiency of various algorithms is called the ____ of algorithms.

In the sequential search algorithm, the minimum amount of work is done if the value being searched for is the ____ value in the list.

The shuffle-left algorithm is not space-efficient.

Of all the desirable properties for algorithms, efficiency is the most easily quantifiable.

The sequential search and selection sort algorithms are different methods to get the same thing done.

The shuffle-left algorithm is a(n) ____ algorithm in the best case.

When does the worst case in binary search occur?

The brute-force bin-packing algorithm is very useful.

What is the unit of work in the data cleanup algorithm?

The time/space tradeoff is the choice between algorithms where you gain something while giving up something else.

It is sufficient for an algorithm to provide correct results for only the input values that we expect are the most likely to occur.

The problem of placing objects in alphabetical or numerical order is called ____.

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