GCSE Computing - Searching & Sorting algorithms #1

What is the maximum amount of passes needed to sort 11 pieces of data?

• 10

• 11

• 7

• 5

We are sorting the following list in ascending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the bubble sort algorithm. 

• 1 2 4 3 8 5 9
• 1 4 2 5 3 8 9
• 4 2 9 3 8 5 1

How many linear searches will it take to find the value 7 in the list [1,4,8,7,10,28]?

• 2
• 3
• 4
• 5

A Linear search algorithm requires data to be ordered.

• True
• False

What is an advantage of the Linear search algorithm?

• Performs well with small sized data sets
• Can be used on data sets with more than a million elements
• Is complicated to code

What is a disadvantage of the Linear search algorithm?

• It will only work on a sorted data set
• May be too slow to process large data sets

The first part of a bubble sort algorithm is pictured here. Which of the following options would correctly complete the algorithm?

• 
• 
• 
• 

Select 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

Which expression best defines bubble sort?

• n+1

• n=1

• n-1

• n/1

What would the list [9, 6, 12, 7, 3, 16, 10] look like after one iteration of the Bubble sort algorithm (smallest to biggest)?

• [6, 9, 7, 3, 12, 10, 16]

• [3, 9, 6, 12, 7, 16, 10]

• [3, 6, 7, 9, 10, 12, 16]

• [9, 6, 12, 3, 7, 16, 10]