Video 60 - Merge Sort

Video 60 - Merge Sort

10th Grade

8 Qs

quiz-placeholder

Similar activities

Word Lesson 11 Review Kasey Wright

Word Lesson 11 Review Kasey Wright

9th - 12th Grade

11 Qs

Christmas quiz

Christmas quiz

1st - 12th Grade

10 Qs

Pretest Spreadsheet 1

Pretest Spreadsheet 1

10th Grade

10 Qs

Marketing Functions

Marketing Functions

10th - 12th Grade

12 Qs

Mail Merge Quiz

Mail Merge Quiz

10th Grade

10 Qs

Hungry Games Point Value

Hungry Games Point Value

7th Grade - Professional Development

10 Qs

Rocket League quiz (items)

Rocket League quiz (items)

4th - 12th Grade

11 Qs

Math in the real world

Math in the real world

9th - 12th Grade

10 Qs

Video 60 - Merge Sort

Video 60 - Merge Sort

Assessment

Quiz

Other

10th Grade

Hard

Created by

A Islam

Used 5+ times

FREE Resource

8 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Merge sort can work on multiple lists at the same time

Merge sort is easier to program than bubble sort

Merge sort is more efficient for small data sets

Merge sort does not require any comparisons

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What method does merge sort use to solve problems?

Divide-and-conquer

Bubble sort

Selection sort

Insertion sort

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What happens to the data set in merge sort?

It is repeatedly split in half until each item is in its own list

It is sorted in reverse order

It is combined with another data set

It is randomly rearranged

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the purpose of merging adjacent items in merge sort?

To combine their solutions and solve the bigger problem

To create identical sub-problems

To split the data set in half

To compare items in adjacent lists

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm works well for large data sets?

Merge sort

Bubble sort

Selection sort

Insertion sort

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the first step in the merge sort algorithm?

Splitting the initial list into individual lists of one item

Comparing items in adjacent lists

Merging adjacent items

Sorting the data set in alphabetical order

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What happens if an item in merge sort has nothing to compare to?

It goes into a new list on its own

It is skipped and ignored

It is merged with the previous item

It is removed from the data set

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the final step in the merge sort algorithm?

Comparing the bottom item of the bottom list with the bottom item of the top list

Moving all the remaining items to the new merged list

Sorting the data set in reverse order

Removing any duplicate items