Sorting Algorithms: Bubble and Merge

QuizÂ by GCSE AQA Computer Science

GCSE (AQA)
Computer Science
English National Curriculum

Feel free to use or edit a copy

includes Teacher and Student dashboards

### Measures 1 skill fromGCSE (AQA)Computer ScienceEnglish National Curriculum

3.1.4.a

Track each student's skills and progress in your Mastery dashboards

• edit the questions
• save a copy for later
• start a class game
• automatically assign follow-up activities based on studentsâ€™ scores
• assign as homework
• share a link with colleagues
• print as a bubble sheet

### Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

12 questions
• Q1
Which algorithm iterates through a data set repeatedly, swapping values that are in the wrong order?
Binary
Merge
Linear
Bubble
45s
3.1.4.a
• Q2
Using a bubble sort on the following list: 3, 17, 6, 5, 8. What will the list look like after the first pass?
3,5,6,8,17
3,17,6,8,5
3,6,5,8,17
17,8,6,5,3
45s
3.1.4.a
• Q3
Using a bubble sort on the following list: 3, 17, 6, 5, 8. What will the list look like after the second pass?
17,8,6,5,3
3,5,6,8,17
3,5,6,8,17
3,17,6,8,5
45s
3.1.4.a
• Q4
How many passes would the following list (3,17,6,5,8) need to sort it using a bubble sort?
One
Two
Three
Four
45s
3.1.4.a
• Q5
Why do you need an additional pass through a list at the end of a bubble sort?
You do not need a final pass
To make the algorithm more complex
As a final validation check
To make it look neater
45s
3.1.4.a
• Q6
What is the first action in a merge sort?
To compare the first two values
To compare the last two values
To split the items up into their own data sets
To split the data set at the middle value
45s
3.1.4.a
• Q7
Which sorting algorithm needs to iterate through the list repeatedly?
Binary
Merge
Bubble
Linear
45s
3.1.4.a
• Q8
Which sorting algorithm splits a list of items into individual lists?
Linear
Merge
Bubble
Binary
45s
3.1.4.a
• Q9
What sorting algorithm does this pseudocode represent?
Bubble
Linear
Binary
Merge
45s
3.1.4.a
• Q10
Which sorting algorithm uses the divide and conquer approach to sorting data sets?
Bubble
Insertion
Merge
None of these
45s
3.1.4.a
• Q11
What does a sorting algorithm do?
Sorts data sets into alphabetical or numerical order
Searches data sets by comparing values
Writes data items to an array or list
Saves data items in an array or list
45s
3.1.4.a
• Q12
How can a trace table help with sorting algorithms?
All of these
It can be used to keep track of where you have previously swapped values
You can use it to test the algorithm for logical errors
It can be used to keep track of progression through the swaps or passes
45s
3.1.4.a

Teachers give this quiz to your class