Algorithms5G – ReviseComputerScience

Skip to content

ReviseComputerScience

Free Resources
Student Dashboard
Teacher Dashboard
Legal
Login
Cart / £0.00
0

You do not have access to this content.

In order to access the 'Quiz Zone' and all of its contents, please purchase a 'Premium Course'.

Time limit: 0

Quiz Summary

0 of 10 questions completed

Questions:

1
2
3
4
5
6
7
8
9
10

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading...

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 10 questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Problem Solving / Algorithms 0%

Aaah, relax, its over! Now take a look at your result and spend further time revising any areas of the test that you got incorrect.

1
2
3
4
5
6
7
8
9
10

Answered
Review

Question 1 of 10

1. Question
Which description best describes a bubble sort algorithm?
- The data set is repeatedly halved until each item is separated, then each pair of data is ordered, then each pair of pairs is ordered etc, until the data set is recombined in a sorted manner.
- The algorithm repeatedly steps through a data set, comparing each pair in the data set, swapping them if they are in the wrong order.
- The algorithm steps through the data set and the data items are re-positioned into a new ordered list, one item at a time.
- The data set is repeatedly stepped through and on each pass, the smallest item is swapped with the left most unsorted item, until the entire data set is in order.
Correct

Incorrect
Question 2 of 10

2. Question
What is a PASS when discussing a bubble sort?
- It is the swapping of two numbers to get them ordered.
- It is when two numbers are not swapped (left in the same order) as they are already in order.
- It is the term used to describe one complete sweep of the data set.
- It is the term used to describe the situation when no items are reordered in a data set (as they are already ordered).
Correct

Incorrect
Question 3 of 10

3. Question
True or False: A 'Bubble Sort' algorithm will step through the data set one more time before stopping, after the data set had been ordered on the previous pass.
- True
- False
Correct

Incorrect
Question 4 of 10

4. Question
True or False: The 'Bubble Sort' algorithm makes use of the principles of 'Divide and Conquer'.
- True
- False
Correct

Incorrect
Question 5 of 10

5. Question
Consider the data set [5, 6, 2, 4]. What will the data set be after the first pass?
- [5, 6, 2, 4]
- [6, 5, 4, 2]
- [6, 2, 4, 5]
- [2, 4, 5, 6]
- [5, 2, 4, 6]
Correct

Incorrect
Question 6 of 10

6. Question
How many passes will be required to order the data [5, 6, 2, 4]?
- 1
- 2
- 3
- 4
Correct

Incorrect
Question 7 of 10

7. Question
Which answer shows the correct intermediate steps when the following data set is being sorted using a bubble sort? [16, 21, 11, 19]
- 16,11,21,19 -- 16,11,19,21 -- 11,16,19,21
- 11, 21,16,19 -- 11,16,21,19 -- 11,16,19,21
- 16,21,11,19 -- 16,11,21,19 -- 11,16,21,19 -- 11,16,19,21
- 16,19,11,21 -- 11,19,16,21 -- 11,16,19,21 -- 11,16,19,21
Correct

Incorrect
Question 8 of 10

8. Question
True or False: A Bubble Sort is considered inefficient when compared to most other sorting algorithms.
- True
- False
Correct

Incorrect
Question 9 of 10

9. Question
Consider the following array [8, 3, 5, 2, 1]. How many passes will be required to move the value '1' to the start of the array?
- 1
- 2
- 3
- 4
- 5
Correct

Incorrect
Question 10 of 10

10. Question
Consider the following array [8, 3, 5, 2, 1]. How many passes will be required to move the value '8' to the end of the array?
- 1
- 2
- 3
- 4
- 5
Correct

Incorrect

Copyright © 2020 ReviseComputerScience | Powered by Astra WordPress Theme

Scroll to Top

Login

Username or Email Address

Password

Remember Me

Lost Your Password?