10 Minute Test 19 - Algorithms

10 Minute Test 19 - Algorithms

9th - 10th Grade

17 Qs

quiz-placeholder

Similar activities

Algorithms

Algorithms

10th - 11th Grade

20 Qs

Search Algorithms

Search Algorithms

10th Grade

21 Qs

Algorithms Review

Algorithms Review

10th Grade

18 Qs

Merge Sort

Merge Sort

10th Grade

14 Qs

Algorithms

Algorithms

3rd - 12th Grade

15 Qs

Searching and Sorting Algorithms

Searching and Sorting Algorithms

9th - 10th Grade

16 Qs

Bubble Sort

Bubble Sort

1st Grade - Professional Development

13 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

10 Minute Test 19 - Algorithms

10 Minute Test 19 - Algorithms

Assessment

Quiz

Computers

9th - 10th Grade

Medium

Created by

Laura Boyd

Used 1+ times

FREE Resource

17 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following can only be carried out on an ordered list?

Linear search

Binary Search

Bubble sort

Insertion sort

2.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Computational thinking involves the use of the 3 core problem solving skills...

maths

abstraction

decomposition

problem solving

algorithmic thinking

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Computational thinking is used to...

...improve the efficiency of an existing program or piece of code

... turn a problem into something a computer can help you solve

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A programmer solves a complex task by writing many small sub-programs. This is an example of...

decomposition

abstraction

authentication

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A programmer, when planning a solution for a problem filters out the important information and ignores the irrelevant details. This is an example of...

decomposition

abstraction

authentication

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is most efficient when dealing with large sets of data?

bubble sort

insertion sort

merge sort

7.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Identify the advantages of an insertion sort...

Efficient when sorting a small list of data

Memory efficient (as all sorting is done in the original list)

Can quickly check if list is already sorted

Easy to implement

Inefficient when sorting long lists

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?