Upgrade to remove ads
Only $35.99/year

Unit 3 Test

Terms in this set (20)

If there are n nodes in a graph, then a Hamiltonian circuit (if it exists) must have ____ links.
n
The ____ algorithm does the same amount of work no matter how the numbers are initially arranged.
selection sort
Given the data cleanup problem of removing 0 values from a data set, the ____ algorithm squeezes 0 values out of the list by copying each remaining data item in the list one cell to the left.
shuffle-left
Which search algorithm works by halving the list of items to search?
binary
Sequential search is an order-n algorithm in the ____.
average and worst case
A ____ repeatedly compares a value being searched for against value in an unordered list. This process continues until the desired value is found or the list is exhausted.
sequential search
The ____ search algorithm is more efficient than the ____ search algorithm but it works only when the search list is already sorted.
binary, sequential
When the registrar at your institution sorts students in a class by name, he or she is using the ____ algorithm.
selection sort
____ is the term to describe an algorithm's careful use of resources.
Efficiency
____ is the algorithmic equivalence of style.
Elegance
Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms.
approximation
Even if the largest number in the unsorted section of a list is already at the end of the unsorted section, the ____ algorithm will exchange this number with itself.
selection sort
Given the data cleanup problem of removing 0 values from a data set, the ____ algorithm scans a list from left to right and copies every legitimate value into a new list that it creates.
copy-over
Which of the following is NOT an extremely desirable attribute of an algorithm?
abstraction
Computers are often compared in terms of the number of ____ they can crank out.
flops
The comparative timing of algorithms is called ____.
benchmarking
A(n) ____ algorithm to solve the problem of routing an email message along the shortest possible path through intermediate computers from your mail server to the destination mail server would examine all possible paths to the destination and then use the shortest one.
exponential
Solvable problems for which no polynomially bounded algorithms exist are called ____.
intractable
An algorithm that does cn^2 work for any constant c is order of magnitude ____.
n^2
The study of the efficiency of algorithms is called the ____ of algorithms.
analysis
Students also viewed