Question 1

In a bubble sort algorithm, which of the following describes the main operation performed during each pass through the array?

Accepted Answer

Comparing and swapping adjacent elements

Answer

Finding the maximum element only

Answer

Sorting elements in ascending order directly

Answer

Dividing the array into halves

Question 2

Which of the following best describes when a bubble sort algorithm is considered 'sorted'?

Accepted Answer

When no swaps are required in a complete pass

Answer

When all elements are the same

Answer

When the first element is the largest

Answer

When the last element is the smallest

Question 3

What modification can be made to the bubble sort algorithm to improve its efficiency when sorting nearly sorted arrays?

Accepted Answer

Implement a flag to check for swaps

Answer

Use a stack to store elements temporarily

Answer

Reverse the array after sorting

Answer

Add more comparisons in each pass

Question 4

In which scenario might bubble sort actually perform well?

Accepted Answer

When the data is nearly sorted

Answer

When sorting very large arrays

Answer

When sorting strings by length

Answer

When data is randomly ordered

Question 5

How does the bubble sort algorithm determine which elements to swap?

Accepted Answer

By comparing adjacent elements

Answer

By selecting the minimum element

Answer

By comparing non-adjacent elements

Answer

By checking the total count of elements

Question 6

What happens to the largest unsorted element during each complete pass of the bubble sort?

Accepted Answer

It moves to its correct position at the end of the array

Answer

It stays in the same position

Answer

It becomes the first element in the sorted section

Answer

It moves to the beginning of the array

Question 7

How many passes are needed to completely sort an array of n elements using bubble sort in the worst case?

Accepted Answer

n-1 passes

Answer

n^2 passes

Answer

n passes

Answer

n+1 passes

Question 8

What is the primary purpose of the bubble sort algorithm?

Accepted Answer

To sort a list of numbers in ascending order

Answer

To find the maximum number in a list

Answer

To merge two lists together

Answer

To reverse the order of numbers in a list

Question 9

What happens during each pass of the bubble sort algorithm?

Accepted Answer

Adjacent elements are compared and swapped if they are out of order

Answer

Elements are sorted in descending order

Answer

Elements are added to a new list

Answer

The largest element is removed from the list

Question 10

What is the main disadvantage of the bubble sort algorithm compared to more advanced sorting algorithms?

Accepted Answer

It is generally less efficient for large datasets

Answer

It sorts data in a descending order only

Answer

It requires more memory than quicksort

Answer

It can only be used with integers

Question 11

What is one of the key characteristics of the bubble sort algorithm?

Accepted Answer

It repeatedly passes through the list until it is sorted

Answer

It uses a divide and conquer strategy

Answer

It sorts elements by merging them

Answer

It requires additional memory equivalent to the input size

Related quizzes

Related quizzes