1. A ________ algorithm is a method of locating a specific item of information in a larger
collection of data.
A) sort
B) standard
C) None of these
D) search
E) linear
2. ___________ algorithms are used to arrange random data into some order.
A) None of these
B) Sorting
C) Linear
D) Standard search
E) Binary search
3. When an array is sorted from highest to lowest, it is said to be in _____ order.
A) ascending
B) None of these
C) descending
D) forward
E) reverse
4. True/False: The number of comparisons made by a binary search is expressed in powers of
two.
A) True
B) False
5. True/False: Before you can perform a bubble sort, the data must be stored in descending
order.
A) True
B) False
6. True/False: A linear search can only be implemented with integer values.
A) True
B) False
7. The _________ sort usually performs fewer exchanges than the ________ sort.
A) None of these
B) ANSI, ASCII
C) selection, bubble
D) binary, linear
E) bubble, selection
8. Data that is sorted in ascending order is ordered
A) from highest to lowest value
B) always with a linear sort algorithm
C) always with a binary sort algorithm
D) None of these
E) from lowest to highest value
9. Using a linear search to find a value that is stored in the last element of an array of 20,000
elements, ____________ element(s) must be compared.
A) only the first
B) None of these
C) only half
D) 2000
E) 20,000
10. A(n) ________ search is more efficient than a(n) ________ search
A) character, string
B) None of these
C) binary, linear
D) linear, binary
E) integer, double