Search Header Logo

Alsager - CT Block 5

Authored by Richard Steed

Computers

4th Grade

Used 1+ times

Alsager - CT Block 5
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

18 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of algorithm is merge sort?

Greedy algorithm

Divide-and-conquer algorithm

Dynamic programming algorithm

Backtracking algorithm

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the merge sort algorithm particularly suitable for?

Sorting small datasets quickly

Sorting large datasets efficiently

Finding the shortest path in a graph

Encrypting data

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How does merge sort operate on a dataset?

By selecting the maximum element each time

By partitioning the dataset into a balanced binary tree

By splitting the dataset into two parts repeatedly until each subset is a single item

By swapping adjacent elements if they are in the wrong order

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What happens after each pair of subsets is processed in merge sort?

They are shuffled to increase randomness

They are sorted using a different algorithm

They are merged back together in order

They are compared with each other to find the smallest element

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When does the merging process stop in merge sort?

When the dataset is split into the smallest possible subsets

When the subsets are merged into one set of three items

When there is one set remaining – the sorted list

When the algorithm has run for a predetermined number of iterations

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the first step in the merge sort algorithm?

Merge pairs of sub-lists in order.

Repeat until one ordered list remains.

Keep dividing the list into sub-lists until each list has exactly 1 item.

Arrange the items in alphabetical order.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What must be done after dividing the list into sub-lists in the merge sort algorithm?

Sort each sub-list individually.

Merge pairs of sub-lists in order.

Combine all sub-lists at once.

Repeat the division process.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?