Alsager - CT Block 5

Alsager - CT Block 5

4th Grade

18 Qs

quiz-placeholder

Similar activities

Scratch Programming

Scratch Programming

1st - 12th Grade

13 Qs

ôn tập cuối kì 2-10

ôn tập cuối kì 2-10

KG - 10th Grade

20 Qs

Working with windows 7

Working with windows 7

4th Grade

20 Qs

Algorithms

Algorithms

3rd - 12th Grade

15 Qs

Flowcharts

Flowcharts

4th - 6th Grade

20 Qs

Microsoft Excel

Microsoft Excel

4th Grade

20 Qs

Advanced Excel

Advanced Excel

KG - University

20 Qs

TIK kelas 4

TIK kelas 4

4th Grade

20 Qs

Alsager - CT Block 5

Alsager - CT Block 5

Assessment

Quiz

Computers

4th Grade

Medium

Created by

Richard Steed

Used 1+ times

FREE Resource

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.

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?