Q: Merge Sort Algorithm GCSE

Quiz Summary

0 of 10 Questions completed

Questions:

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:

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

Categories

Problem Solving / Algorithms 0%

Current
Review
Answered
Correct
Incorrect

Question 1 of 10

1. Question

Category: Problem Solving / Algorithms
Which description best describes the merge 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 algorithm steps through the data set and for each item it finds, the algorithm compares it repeatedly with the items positioned to the left. The item is then re-positioned into the data set ensuring that the left side of the array is ordered.
- 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

Category: Problem Solving / Algorithms
True or False: The ‘Merge Sort’ algorithm makes use of the principles of ‘Divide and Conquer’.
- True
- False
Correct

Incorrect
Question 3 of 10

3. Question

Category: Problem Solving / Algorithms
True or False: A Merge Sort is considered inefficient when compared to most other sorting algorithms.
- True
- False
Correct

Incorrect
Question 4 of 10

4. Question

Category: Problem Solving / Algorithms
What is the name of this sorting algorithm?
- Merge Sort
- Bubble Sort
- Heap Sort
- Insertion Sort
- Quick Sort
Correct

Incorrect
Question 5 of 10

5. Question

Category: Problem Solving / Algorithms
What is the name of this sorting algorithm?
- Merge Sort
- Bubble Sort
- Heap Sort
- Insertion Sort
- Quick Sort
Correct

Incorrect
Question 6 of 10

6. Question

Category: Problem Solving / Algorithms
What is the name of this sorting algorithm?
- Merge Sort
- Bubble Sort
- Heap Sort
- Insertion Sort
- Quick Sort
Correct

Incorrect
Question 7 of 10

7. Question

Category: Problem Solving / Algorithms
Is it possible to sort letters as well as numbers in a merge sort? Choose the option which most accurately answers this question.
- No, because letters are not numerical and the algorithm will not be able to work out the order when comparing letters.
- No, because a merge sort is not intelligent and does not know the order of letters.
- Yes, because a merge sort is an intelligent sort and knows the order of letters.
- Yes, because each letter will have a binary number that can be sorted.
Correct

Incorrect
Question 8 of 10

8. Question

Category: Problem Solving / Algorithms
What will be the order of the values in each box?
- 68 97
- 86 79
- 68 79
- 67 89
- 86 97
- 69 78
Correct

Incorrect
Question 9 of 10

9. Question

Category: Problem Solving / Algorithms
What will be the order of the values in the bottom box?
- 32 41
- 23 14
- 21 34
- 12 34
- 43 21
Correct

Incorrect
Question 10 of 10

10. Question

Category: Problem Solving / Algorithms
What are the missing values?
- [5] [3] [5738]
- [5] [3] [3578]
- [5] [3] [7583]
- [5] [3] [5783]
- [5] [3] [8753]
Correct

Incorrect

AQA GCSE 8525 (Premium)

Q: Merge Sort Algorithm GCSE

Q: Merge Sort Algorithm GCSE

Quiz Summary

Information

Results

Results

Categories

1. Question

2. Question

3. Question

4. Question

5. Question

6. Question

7. Question

8. Question

9. Question

10. Question