10 Minute Test 19 - Algorithms

10 Minute Test 19 - Algorithms

9th - 10th Grade

17 Qs

quiz-placeholder

Similar activities

Traffic Light Project Quiz

Traffic Light Project Quiz

9th Grade

17 Qs

Yr7- Understanding computers Lessons 1-3

Yr7- Understanding computers Lessons 1-3

7th - 11th Grade

20 Qs

Hardware and Components

Hardware and Components

5th - 11th Grade

19 Qs

Cell Phone Vocabulary

Cell Phone Vocabulary

9th - 12th Grade

12 Qs

History of Computers

History of Computers

6th - 12th Grade

15 Qs

Networking Quiz

Networking Quiz

8th - 9th Grade

15 Qs

Y10M2A2 - Selection

Y10M2A2 - Selection

6th - 10th Grade

15 Qs

Chapter 8: Safety and security

Chapter 8: Safety and security

10th - 11th Grade

14 Qs

10 Minute Test 19 - Algorithms

10 Minute Test 19 - Algorithms

Assessment

Quiz

Computers

9th - 10th Grade

Practice Problem

Medium

Created by

Laura Boyd

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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

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?