Q: Bubble Sort Algorithm GCSE
Quiz Summary
0 of 10 Questions completed
Questions:
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
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%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- Current
- Review
- Answered
- Correct
- Incorrect
-
Question 1 of 10
1. Question
Category: Problem Solving / AlgorithmsWhich description best describes a bubble sort algorithm?
CorrectIncorrect -
Question 2 of 10
2. Question
Category: Problem Solving / AlgorithmsWhat is a PASS when discussing a bubble sort?
CorrectIncorrect -
Question 3 of 10
3. Question
Category: Problem Solving / AlgorithmsTrue 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.
CorrectIncorrect -
Question 4 of 10
4. Question
Category: Problem Solving / AlgorithmsTrue or False: The ‘Bubble Sort’ algorithm makes use of the principles of ‘Divide and Conquer’.
CorrectIncorrect -
Question 5 of 10
5. Question
Category: Problem Solving / AlgorithmsConsider the data set [5, 6, 2, 4]. What will the data set be after the first pass?
CorrectIncorrect -
Question 6 of 10
6. Question
Category: Problem Solving / AlgorithmsHow many passes will the Bubble Sort algorithm carry out in order to sort the data [5, 6, 2, 4]], before completing/stopping?
CorrectIncorrect -
Question 7 of 10
7. Question
Category: Problem Solving / AlgorithmsWhich answer shows the correct intermediate steps when the following data set is being sorted using a bubble sort? [16, 21, 11, 19]
CorrectIncorrect -
Question 8 of 10
8. Question
Category: Problem Solving / AlgorithmsTrue or False: A Bubble Sort is considered inefficient when compared to most other sorting algorithms.
CorrectIncorrect -
Question 9 of 10
9. Question
Category: Problem Solving / AlgorithmsConsider 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?
CorrectIncorrect -
Question 10 of 10
10. Question
Category: Problem Solving / AlgorithmsConsider 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?
CorrectIncorrect