comp sci
it can be used on unordered data
the advantage of a linear search is that ____________. - it is complex - it is fast - i have no idea - it can be used on unordered data - it is efficient
50
to locate a value in an order array of 50 items, using linear search, requires examining at most _____________ values - 6 - none of these - 25 - 1 - 50
false
true/false: a linear search requires that the elements be in order.
false
true/false: before you can perform a selection sort, the data must be stored in ascending order.
true
true/false: in the average case, when searching for an item, it is just as likely to be found near the beginning of an array as near the end
false
true/false: the bubble sort is an easy way to arrange data into ascending order, but it cannot arrange data into descending order.
false
true/false: using a binary search, you are more likely to find an item than if you use a linear search.
middle
a binary search begins with the ____________ element of an array. - none of these - middle - largest - last - first
binary, linear
a(n) _________ search is more efficient than a(n) _______ search. - integer, double - linear, binary - character, string - none of these
binary, linear
a(n) ___________ search is more efficient that a(n) _______________ search. - integer, double - character, string - linear, binary - none of these - binary, linear
linear
a(n) ___________ search uses a loop to sequentially step through an array. - binary - relative - linear - unary - none of these
linear
a(n) ____________ search uses a loop to sequentially step through an array - binary - unary - none of these - relative - linear
binary, linear
a(n) ________________ search is more efficient than a(n) _____________ search. - character, string - none of these - binary, linear - linear, binary - integer, double
6
to locate a value in an ordered array of 50 items, using binary search, requires examining at most ___________ values. - 25 - 1 - 10 - none of these - 6
50
to locate a value in an ordered array of 50 items, using linear search, requires examining at most ___________ values. - none of these - 50 - 6 - 25 - 1
50
to locate a value in an ordered array of 50 items, using linear search, requires examining at most _____________ values. - none of these - 50 - 6 - 1 - 25
50
to locate a value in an ordered array of 50 items, using linear search, requires examining at most _____________ values. -1 - 25 - none of these - 6 - 50
true
true/false: in the average case, when searching for an item, it is just as likely to be found near the beginning of an array as near the end.
descending
when an array is sorted from highest to lowest, it is said to be in _____________ order. - reverse - ascending - forward - none of these - descending
search
__________ algorithm is a method of locating a specific item of information in a collection of data. - search - sort - standard - none of these - linear
sorting
______________________ algorithms are used to arrange random data into some order. - standard search - linear - sorting - binary search - none of these
search
a _________ algorithm is a method of locating a specific item of information in a collection of data. - sort - standard - linear - none of these - search
search
a ___________________ algorithm is a method of locating a specific item of information in a collection of data. - search - sort - standard - none of these - linear
all of these
sorted data could be ordered: - all of these - using a selection sort algorithm - from highest to lowest value - from lowest to highest value - using a binary sort algorithm
all of these
sorted data could be ordered: - from highest to lowest value - using a binary sort algorithm - from lowest to highest value - using a selection sort algorithm - all of these
all of these
sorted data could be ordered: - using a selection sort algorithm - from highest to lowest value - from lowest to highest value - all of these - using a binary sort algorithm
selection, bubble
the _____ sort usually performs fewer exchanges than the _________ sort. - none of these - selection, bubble - binary, linear - bubble, selection - bubble, linear
linear search
the _________ is adequate for searching through small arrays. - none of these - linear search - bubble sort - unary search - binary search
selection, bubble
the __________ sort usually performs fewer exchanges than the __________ sort. - bubble, linear - none of these - bubble, selection - binary, linear - selection, bubble
linear search
the ___________ is adequate for searching through small arrays - binary search - bubble sort - linear search - none of these - unary search
selection, bubble
the ___________ sort usually performs fewer exchanges than the ___________ sort. - binary, linear - bubble, selection - none of these - bubble, linear - selection, bubble
linear search
the _____________ is adequate for searching through small arrays - linear search - bubble sort - binary search - none of these - unary search
descending
when an array is sorted from highest to lowest, it is said to be in _________ order. - reverse - descending - none of these - forward - ascending
descending
when an array is sorted from highest to lowest, it is said to be in __________ order. - forward - descending - none of these - ascending - reverse
descending
when an array is sorted from highest to lowest, it is said to be in ___________ order. - forward - reverse - descending - none of these - ascending
sorted
array elements must be _________ before a binary search can be performed. - summed - sorted - positive numbers - set to zero - none of these
sorted
array elements must be __________ before a binary search can be performed. - positive numbers - none of these - summed - sorted - set to zero
sorted
array elements must be ___________ before a binary search can be performed. - positive numbers - summed - sorted - set to zero - none of these
sorted
array elements must be ____________ before a binary search can be performed. - summed - sorted - none of these - set to zero - positive numbers
all of these
start reportSorted data could be ordered: - using a selection sort algorithm - from lowest to highest value - all of these - from highest to lowest value - using a binary sort algorithm
7
to locate a value in an ordered array of 100 items, using binary search, requires examining at most __________ values. - 7 - 1 - none of these - 50 - 10
7
to locate a value in an ordered array of 100 items, using binary search, requires examining at most ___________ values. - none - 10 - 7 - 50 - 1
7
to locate a value in an ordered array of 100 items, using binary search, requires examining at most ____________ values. - 10 - 50 - 1 - none of these - 7
100
to locate a value in an ordered array of 100 items, using linear search, requires examining at most _________ values. - 50 - 100 - 1 - none of these - 10
100
to locate a value in an ordered array of 100 items, using linear search, requires examining at most _____________ values. - 100 - 50 - 1 - 10 - none of these
6
to locate a value in an ordered array of 50 items, using binary search, requires examining at most ________ values. - none of these - 10 - 1 - 6 - 25