Algorithms

Algorithms

9th - 11th Grade

25 Qs

quiz-placeholder

Similar activities

Berpikir Komputasional

Berpikir Komputasional

10th Grade

20 Qs

ASK T3 Bab 3 Algoritma

ASK T3 Bab 3 Algoritma

9th Grade

20 Qs

2.3.1 Algorithms

2.3.1 Algorithms

11th Grade

20 Qs

BAB 3 ALGORITMA SEARCH & SORT T3/1

BAB 3 ALGORITMA SEARCH & SORT T3/1

9th Grade

20 Qs

Unit 3 Exam

Unit 3 Exam

9th Grade

24 Qs

Higher Computing - Standard Algorithms

Higher Computing - Standard Algorithms

11th Grade

25 Qs

Algorithms

Algorithms

10th - 11th Grade

27 Qs

2.1 Algorithms

2.1 Algorithms

10th - 12th Grade

20 Qs

Algorithms

Algorithms

Assessment

Quiz

Computers

9th - 11th Grade

Medium

Created by

Rachel Pugh

Used 4+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is pseudocode?
Simplified programming language, that is not a specific language
Complicated programming language
Simple programming language, which is linked to a specific language
A type of cheese

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does a searching algorithm do?
Search through a set of data
Save a set of data
Help to organise data

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of these is a type of searching algorithm?
Linear search
Word search
Search engine

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

An algorithm is...
A set of steps to solve a problem
When you sort data into the correct order
When you search data for a specific value
Any written code

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the best description of the linear search algorithm?
Put the elements in order, then go through them one by one until target is found or the end of the list is reached.
Put the elements in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 
Elements do not need to be in order. Go through them one by one until target is found or the end of the list is reached.
Elements do not need to be in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the best description of the binary search algorithm?
Put the elements in order, then go through them one by one until target is found or the end of the list is reached.
Put the elements in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 
Elements do not need to be in order. Go through them one by one until target is found or the end of the list is reached.
Elements do not need to be in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

As the data set grows in size, linear search becomes more efficient than binary search. 
True
False

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?