Question 1

Which of the following describes the fundamental principle used by the Merge Sort algorithm?

Accepted Answer

Divide and conquer

Answer

Linear search

Answer

First-in, last-out

Answer

Bubble and swap

Question 2

In the 'divide' stage of Merge Sort, when is the process of splitting the lists stopped?

Accepted Answer

When each sub-list contains only one element

Answer

When the list is split into two equal halves

Answer

When all elements are in reverse order

Answer

When the first element is smaller than the last element

Question 3

Which of the following is a disadvantage of using Merge Sort compared to an 'in-place' algorithm like Bubble Sort?

Accepted Answer

It requires more memory to store the sub-lists during the sorting process

Answer

It only works if the number of items is a power of 2

Answer

It cannot be used to sort lists containing strings

Answer

It is much slower when dealing with very large datasets

Question 4

If you are using Merge Sort to sort a list of

8

items, how many times will the list be divided (halved) before the individual elements are reached?

Accepted Answer

3

Answer

8

Answer

4

Answer

7

Question 5

When merging two sorted sub-lists back together in Merge Sort, how does the algorithm determine the order of elements?

Accepted Answer

It compares the first element of each sub-list and moves the smaller one into the new list

Answer

It only compares the last elements of the sub-lists

Answer

It randomly picks an element from either list to ensure variety

Answer

It adds all elements from the first sub-list followed by all elements of the second

Question 6

Which of the following statements about the efficiency of Merge Sort is correct?

Accepted Answer

It is more efficient than Bubble Sort for large datasets because it has a better time complexity

Answer

It is only efficient if the original list is already partially sorted

Answer

It is the least efficient sorting algorithm because it requires numerous recursive calls

Answer

It is less efficient than Bubble Sort because it uses a complex divide and conquer method

Question 7

Which of the following describes the 'Merge' step in the Merge Sort algorithm?

Accepted Answer

Combining two sorted sub-lists into a single, ordered list

Answer

Finding the smallest element in a list and moving it to the front

Answer

Swapping adjacent elements if they are in the wrong order

Answer

Splitting a large list into two smaller halves

Question 8

Which of the following best describes the state of a list after the first 'divide' stage of Merge Sort has been completed on a list of 10 items?

Accepted Answer

The list is split into two sub-lists of 5 items each

Answer

The list is fully sorted in ascending order

Answer

The smallest item is moved to the first position

Answer

The list is split into ten sub-lists of 1 item each

Question 9

Which of the following is a characteristic of the Merge Sort algorithm?

Accepted Answer

It is a recursive algorithm

Answer

It always sorts the list in a single pass

Answer

It only works on numeric data

Answer

It is an example of an iterative-only approach

Question 10

What is the time complexity of the Merge Sort algorithm in its worst-case scenario?

Accepted Answer

O(n \log n)

Answer

O(n \log n)

Answer

O(n \log n)

Answer

O(n \log n)

Question 11

If a Bubble Sort algorithm is applied to the list [5, 2, 8, 1, 9], what will the list look like after the first full pass?

Accepted Answer

[2, 5, 1, 8, 9]

Answer

[1, 2, 5, 8, 9]

Answer

[2, 5, 8, 1, 9]

Answer

[1, 5, 2, 8, 9]

Question 12

Which of the following is an advantage of Insertion Sort over Bubble Sort when dealing with a list that is already almost sorted?

Accepted Answer

Insertion Sort generally performs fewer comparisons and swaps to complete the sort compared to a standard Bubble Sort.

Answer

Insertion Sort is the only algorithm that can handle decimal numbers.

Answer

Insertion Sort will always take exactly

8

passes regardless of the list order.

Answer

Insertion Sort uses significantly more memory than Bubble Sort.

Question 13

An Insertion Sort is being used to sort the list [3, 7, 2, 5] into ascending order. What will the list look like after the number 2 has been processed and inserted into its correct position?

Accepted Answer

[2, 3, 7, 5]

Answer

[7, 3, 2, 5]

Answer

[2, 3, 5, 7]

Answer

[3, 2, 7, 5]

Question 14

During a Bubble Sort of the list [6, 4, 3, 1], how many swaps will occur in the very first pass?

Accepted Answer

3

Answer

4

Answer

1

Answer

2

Question 15

Which of the following statements correctly describes a key difference between Bubble Sort and Insertion Sort?

Accepted Answer

Bubble Sort compares and swaps adjacent items repeatedly, whereas Insertion Sort places each item into its correct position relative to the sorted part of the list.

Answer

Bubble Sort is generally much faster than Insertion Sort for large datasets.

Answer

Insertion Sort works by finding the smallest element in the list and moving it to the front during every pass.

Answer

Bubble Sort is more efficient because it only requires one single pass to sort any unsorted list.

Related quizzes

Related quizzes