1. A(n) ________ search uses a loop to sequentially step through an array.
A. binary
B. unary
C. linear
D. relative
E. None of these


2. True/False: A linear search can only be implemented with integer values.
A. True
B. False


3. Sorted data is always ordered:
A. from lowest to highest value
B. from highest to lowest value
C. using a binary sort algorithm
D. using a linear sort algorithm
E. None of these


4. A search through an array is always performed:
A. from lowest to highest element
B. from highest to lowest element
C. beginning with the middle element
D. using a binary search
E. None of these


5. When an array is sorted from highest to lowest, it is said to be in _____ order.
A. reverse
B. forward
C. descending
D. ascending
E. None of these


6. The _________ is adequate for searching through small arrays.
A. binary search
B. linear search
C. unary search
D. bubble sort
E. None of these


7. ___________ algorithms are used to arrange random data into some order.
A. Standard search
B. Linear
C. Sorting
D. Binary search
E. None of these


8. True/False: Before you can perform a selection sort, the data must be stored in ascending order.
A. True
B. False


9. True/False: Before you can perform a bubble sort, the data must be stored in descending order.
A. True
B. False


10. True/False: Using a binary search, you are more likely to find an item than if you use a linear search.
A. True
B. False



This is the end of the test. When you have completed all the questions and reviewed your answers, press the button below to grade the test. (this feature has been disabled).