BTEC Unit 1 PART C (7) Common Algorithms Revision Quiz

What is a bubble sort?

• A sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order

• A data structure used to store elements in a hierarchical order

• A method to search for an element in a sorted array by repeatedly dividing the search interval in half

• A technique to find the shortest path in a graph

How does a quicksort algorithm work?

• It repeatedly merges sorted subarrays.

• It selects a pivot element and partitions the array around the pivot.

• It builds a heap and sorts the array using heap operations.

• It uses a dynamic programming approach to sort the array.

What is the significance of selecting a pivot value in the quick sort algorithm?

• It helps in dividing the array into two sub-arrays for further sorting.

• It merges two sorted arrays into one.

• It finds the maximum value in the array.

• It reverses the array.

What is the advantage of insertion sort over bubble sort?

• Insertion sort is more efficient for small data sets.

• Insertion sort has a better worst-case time complexity.

• Insertion sort is easier to implement.

• Insertion sort requires less memory.

When should you use a quick sort?

• When the data is already sorted

• When the data is small

• When the data is large and unsorted

• When the data contains many duplicates

Which of the following is an advantage and a disadvantage of a bubble sort?

• Simple to implement, but inefficient for large datasets

• Efficient for large datasets, but complex to implement

• Requires additional memory, but is very fast

• Stable and adaptive, but requires complex data structures

What is the main advantage of using a linear search?

• It is faster than binary search.

• The list does not have to be in order.

• It requires fewer comparisons.

• It can only be used with sorted lists.

Which of the following is a characteristic of a binary search?

• It can be used on unsorted lists.

• It requires the list to be sorted.

• It always starts from the first element.

• It is slower than a linear search.

How is the middle of the set calculated when performing a binary search?

• By dividing the length of the set by 2

• By finding the average of the first and last indices

• By using the median value of the set

• By using the mode of the set

What is the result of dividing 19 by 2 in the context of binary search?

• 9

• 9.5

• 10

• 8