Have an account?
Skip to Content
Build your own quiz
Suggestions for you
17 questions
Show Answers
See Preview
- 1. Multiple ChoiceWhich type of lists or data sets are linear searching algorithms used for?Unsorted lists or data setsSorted lists or data sets
- 2. Multiple ChoiceWhich type of lists or data sets are binary searching algorithms used for?Unsorted lists or data setsSorted lists or data sets
- 3. Multiple ChoiceSelect the best description to explain what a linear search algorithm is.Put the elements in order, check each item in turn.Put the elements in order, compare with the middle value, split the list in order and repeat.Elements do not need to be in order, check each item in turn.Elements do not need to be in order, compare to the middle value, split the list in order and repeat
- 4. Multiple Choice
Select the best description to explain what a binary search algorithm is.
Put the elements in order, check each item in turn.
Put the elements in order, compare with the middle value, split the list in order and repeat.
Elements do not need to be in order, check each item in turn.
Elements do not need to be in order, compare to the middle value, split the list in order and repeat
- 5. Multiple ChoiceA linear search is to be performed on the list:
12 6 8 1 3
How many comparisons would it take to find number 1?1234 - 6. Multiple ChoiceA binary search is to be performed on the list:
3 5 9 10 23
How many comparisons would it take to find number 9?0-12-34-5I can't find the number 9 - 7. Multiple ChoiceA binary search is to be performed on the list:
1 5 10 13 48 68 100 101
How many comparisons would it take to find number 101?0-11-23-44-5 - 8. Multiple ChoiceDescribe an advantage of a linear search algorithmData does not need to be in order.Performs well over large ordered lists.Can only work on an ordered list. If unordered must use a linear search.Slow with large data sets.
- 9. Multiple Choice
Which of these are search algorithms?
Bubble
Merge
Linear
Binary
Caesar
- 10. Multiple Choice
Which of these algorithms searches for something by first looking in the middle of a list?
Bubble sort
Merge sort
Linear search
Binary search
- 11. Multiple Choice
Which of these algorithms eliminates half of its possibilities each time it makes a check?
Binary search
Bubble sort
Merge sort
Linear search
- 12. Multiple ChoiceWhat does a linear search do?Looks at the first item of data, then each one in turn, until it finds the data item requestedOrganises the data into alphabetical orderSplits the data until the requested data is found
- 13. Multiple ChoiceWhat is an advantage of a linear search?It is very quickIt only works with ordered listsIt is a simple algorithm
- 14. Multiple ChoiceWhat does a binary search do?Looks at the first item of data, then each one in turn, until it finds the data item requestedConverts all the data into binaryTakes the data and splits it in half repeatedly until it finds the data item requested
- 15. Multiple ChoiceWhat does a binary search do?Looks at the first item of data, then each one in turn, until it finds the data item requestedConverts all the data into binaryTakes the data and splits it in half repeatedly until it finds the data item requested
- 16. Multiple ChoiceWhich search algorithm would be best to use with ordered data?A binary searchEither binary search or a linear searchA linear search
- 17. Multiple ChoiceWhat is an advantage of a binary searchIt's very quickIt only works with ordered listsIt is a simple algorithm
- Answer choicesTagsAnswer choicesTags