20 questions

- 1. Multiple ChoiceWhat does a searching algorithm do?Search through a set of dataSave a set of dataHelp to organise data
- 2. Multiple ChoiceWhat would be needed if searching algorithms didn't exist?The data would need to be savedEach item of data would need to be looked at one by one, until the searched for data was foundA new set of data to look at would be needed
- 3. Multiple ChoiceWhich of these is a type of searching algorithm?Linear searchWord searchSearch engine
- 4. 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
- 5. Multiple ChoiceWhat is an advantage of a linear search?It is very quickIt only works with ordered listsIt is a simple algorithm
- 6. Multiple ChoiceWhich of the following is NOT an advantage of a serial search?It can be used on any set of data regardless of typeIt is the quickest search to useIt is a simple algorithm, so it is easy to write a computer program to carry it out
- 7. 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
- 8. Multiple ChoiceWhich search algorithm would be best to use with ordered data?A binary searchEither binary search or a linear searchA linear search
- 9. Multiple ChoiceWhat is an advantage of a binary searchIt's very quickIt only works with ordered listsIt is a simple algorithm
- 10. Multiple ChoiceWhat is the biggest disadvantage of a binary search?It is slowIt can only be used if the data is sorted into an orderIt takes the data and keeps dividing it in half until it finds the item it is looking for
- 11. Multiple ChoiceWhat does a sorting algorithm do?Finds an item of data in a set of dataSaves a set of dataPuts a list of items into order
- 12. Multiple ChoiceWhich of the following is not a sorting algorithm?Bubble SortLong SortInsertion Sort
- 13. Multiple ChoiceWhat does a bubble sort do?Sorts a list by comparing two items that are side by side, to see which is out of orderSeparates a list of data into different collections of data, before sorting and gathering back into a listFinds an item of data in a list
- 14. Multiple ChoiceHow many passes will a bubble sort go through?Only one passTwo passesSeveral passe - until the data is fully ordered
- 15. Multiple ChoiceWhy does a bubble sort do a final pass even when the data is in the correct order?To save the dataIt does not recognise that the data is in order until the final pass requires no changesIt needs to do this to put the data back in to a list
- 16. Multiple ChoiceWhich of the following is an advantage of a bubble sort?It is a very small and simple computer programIt takes a very long time to runIt is very quick
- 17. Multiple ChoiceWhich of the following is NOT an advantage of a bubble sort?It is a very small and simple computer programThere is only one task to performIt is very quick
- 18. Multiple ChoiceWhat does an insertion sort do?Separates a list of data into different collections of data which are sorted and gathered back into a listGoes through a list of data a number of times and compares two items that are side by side to each other to see which is out of orderGoes through a list, comparing two items that are side by side, and continues to move one value until it is in the correct place.
- 19. Multiple ChoiceWhich of the following is an advantage of a insertion sort when compared with a bubble sort?It is quicker than a bubble sort algorithmIt is simpler than a bubble sort algorithmThere is no advantage.
- 20. Multiple ChoiceHow many passes will an insertion sort go through?Only one passTwo passesSeveral passes - until the data is fully ordered
- Answer choicesTagsAnswer choicesTags