Bubble and Merge Sort

Bubble and Merge Sort

10th Grade

10 Qs

quiz-placeholder

Similar activities

Penilaian Tengah Semester

Penilaian Tengah Semester

10th Grade

6 Qs

Merge Sort

Merge Sort

10th Grade

14 Qs

2.1 Bubble sort vs Insertion sort

2.1 Bubble sort vs Insertion sort

10th - 11th Grade

12 Qs

Key Words

Key Words

10th Grade

10 Qs

Quiz Informatika

Quiz Informatika

10th Grade

10 Qs

NOCTI Computer Programming Quiz: Algorithms and Logic

NOCTI Computer Programming Quiz: Algorithms and Logic

10th Grade

10 Qs

2.1.3 Searching Algorithms

2.1.3 Searching Algorithms

10th - 11th Grade

12 Qs

Quiz 1: Berpikir Komputasional X

Quiz 1: Berpikir Komputasional X

10th Grade

15 Qs

Bubble and Merge Sort

Bubble and Merge Sort

Assessment

Quiz

Computers

10th Grade

Medium

Created by

Emma-Louise Brant

Used 32+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

What would be the order of this list after 1 pass of a bubble sort? 5, 2, 18, 7, 6, 9

2, 5, 6, 7, 9, 18

18, 9, 7, 6, 5, 2

2, 5, 7, 6, 9, 18

5, 2, 7, 6, 18, 9

2.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

What does a sorting algorithm do?

Finds an item of data in a set of data

Saves a set of data

Puts a list of items into order

Copies a list of items

3.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

Which of the following is not a sorting algorithm?

Bubble Sort

Insertion Sort

Merge Sort

Long Sort

4.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

How does a bubble sort work?

It sorts a list by comparing neighbouring items to see which is out of order

It takes one item from the list and places it in the correct place

It finds an item of data in a list

It divides the list into sublists and then merges pairs of sublists together to sort the data.

5.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

How does a merge sort work?

It sorts a list by comparing neighbouring items to see which is out of order

It takes one item from the list and places it in the correct place

It finds an item of data in a list

It divides the list into sublists and then merges pairs of sublists together to sort the data.

6.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

7.Why does a bubble sort do a final pass even when the data is in the correct order?

To put the data back into a list

To save the list

Because it doesn't recognise that the list is in order until it completes a final pass with no swaps

To double check in case of mistakes

7.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

8.Which of the following is an advantage of a bubble sort?

It takes a very long time to run

It's very quick

It's simple to implement

There is no advantage of using a bubble sort

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?