43. Algorithms - Merge Sort Quiz

What is the main advantage of merge sort over bubble sort?

• It is easier to program

• It can work on multiple lists at the same time

• It uses a divide and conquer method

• It is faster for small data sets

What method does merge sort use to solve larger problems?

• Trial and error

• Sequential search

• Divide and conquer

• Random selection

How does merge sort repeatedly split the data set?

• Until the largest problem is solved

• In random halves

• In quarters

• Until each item is in its own list

What is the objective of the given data set of breakfast cereals?

• To find the most expensive cereal

• To find the healthiest cereal

• To put them in alphabetical order

• To count the number of cereals

What is the first step of the merge sort algorithm?

• Merging the data set

• Comparing items in adjacent lists

• Repeating the process

• Splitting the initial list into individual lists of one item

What is the purpose of comparing items in adjacent lists in merge sort?

• To find the smallest item

• To find the largest item

• To create a new merge list

• To count the number of items

What happens to the remaining items after all comparisons are done in merge sort?

• They are compared again

• They are discarded

• They are merged into a new list

• They are split into smaller lists

What is the main purpose of the book 'Essential Algorithms for A Level Computer Science'?

• To explain advanced data structures

• To provide exam tips

• To teach basic programming

• To cover every algorithm required for the GCSE

What is the target audience for the book 'Essential Algorithms for A Level Computer Science'?

• University students

• High school students

• Professional programmers

• Primary school students

What is the main focus of the book 'Essential Algorithms for A Level Computer Science'?

• Providing only pseudocode examples

• Explaining hardware components

• Teaching advanced programming concepts

• Illustrating algorithms and providing examples