Search Header Logo

Search Algorithms

Authored by Rachel Pugh

Computers

9th - 11th Grade

Used 10+ times

Search Algorithms
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

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

What would be needed if searching algorithms didn't exist?

The data would need to be saved
Each item of data would need to be looked at one by one, until the searched for data was found
A new set of data to look at would be needed

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of these is a type of searching algorithm?

Linear search
Word search
Search engine

5.

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

6.

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. 

7.

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. 

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?