8525 AQA GCSE  3.1.3 Searching and 3.1.4 Sorting Algorithms

8525 AQA GCSE 3.1.3 Searching and 3.1.4 Sorting Algorithms

10th - 11th Grade

18 Qs

quiz-placeholder

Similar activities

Algorithms

Algorithms

3rd - 12th Grade

15 Qs

AQA GCSE Computer Science - 3.1.2 Efficiency of algorithms

AQA GCSE Computer Science - 3.1.2 Efficiency of algorithms

8th - 10th Grade

20 Qs

Algorithms Review

Algorithms Review

10th Grade

18 Qs

Algorithm Intro

Algorithm Intro

9th Grade - University

14 Qs

KS4 (01) Ethics, Legal, and Searching Algorithms

KS4 (01) Ethics, Legal, and Searching Algorithms

8th - 10th Grade

15 Qs

Linear Search

Linear Search

7th - 12th Grade

16 Qs

Searching and Sorting Algorithms

Searching and Sorting Algorithms

9th - 10th Grade

16 Qs

AQA GCSE Computer Science - 3.1.3 Binary Search

AQA GCSE Computer Science - 3.1.3 Binary Search

8th - 10th Grade

19 Qs

8525 AQA GCSE  3.1.3 Searching and 3.1.4 Sorting Algorithms

8525 AQA GCSE 3.1.3 Searching and 3.1.4 Sorting Algorithms

Assessment

Quiz

Computers

10th - 11th Grade

Medium

Created by

David Anderson

Used 110+ times

FREE Resource

18 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of these is a sorting algorithm?

Compound

Sequential

Merge

Binary

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is described by moving through a list repeatedly, swapping elements that are in the wrong order.

Merge

Bubble

Insertion

Compound

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is described by split a list into individual lists, then combine these, two lists at a time.

Bubble

Merge

Insertion

Dictionary

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm needs to go through the list repeatedly?

Merge

Bubble

Insertion

Iterative

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm splits a list of items into individual lists?

Merge

Bubble

Insertion

Separation

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What happens in stage 2 of the merge sort?

Each pair of sublists is repeatedly merged to produce new sorted sublists

The list is successively divided in half, forming two sublists, until each sublist is of length one

Adjacent numbers are swapped around

The numbers are added together to produce a compound list

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does a linear search do?

Looks at the first item of data, then each one in turn, until it finds the data item requested

Organises the data into alphabetical order

Splits the data until the requested data is found

Takes the first item of information and moves it along a line of data

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?