Which search examines each data item in turn until a match is made or there are no more items to examine?
Linear search
Binary search
Standard search
Which of the following is an advantage of a linear search?
It works on both ordered and un-ordered data sets
It is more efficient than a binary search
It works on strings and integers
Which of the following is a disadvantage of a binary search?
It only works on an ordered list
It is less efficient than a linear search
It only works on integer values
Which of these types of sort is the most efficient?
Bubble sort
Insertion sort
Merge sort
Which of these types of sort is the easiest to program?
What size data set does an insertion sort work most efficiently with?
Large data set
Small data set
Medium data set
What size data set should ideally be sorted with a merge sort?
With a data set of 0,1, 3, 5, 7, 8, 9 how many values would a linear search examine before it found the value 5?
Five
Four
Six
With a data set of 0,1, 3, 5, 7, 8, 9 how many values would a binary search examine before it found the value 8?
Two
With a data set of 0, 1, 5, 3, 8, 9, 7 how many values would a linear search examine before it found the value 9?
Seven