Algorithms

Algorithms

9th - 11th Grade

25 Qs

quiz-placeholder

Similar activities

Computer Science - X

Computer Science - X

8th - 10th Grade

20 Qs

UH1_INFO_XII

UH1_INFO_XII

11th Grade

20 Qs

Google

Google

7th - 12th Grade

20 Qs

Unit Test 1 Class 8 Computer

Unit Test 1 Class 8 Computer

8th - 9th Grade

20 Qs

Software

Software

10th Grade

20 Qs

แบบทดสอบบทที่ 1 เรื่อง ข้อมูลมีคุณค่า ม.5

แบบทดสอบบทที่ 1 เรื่อง ข้อมูลมีคุณค่า ม.5

10th Grade

20 Qs

Logika & Pemrograman (ID)

Logika & Pemrograman (ID)

10th Grade - Professional Development

20 Qs

Q1 M3 PRE-TEST

Q1 M3 PRE-TEST

10th Grade

20 Qs

Algorithms

Algorithms

Assessment

Quiz

Computers

9th - 11th Grade

Practice Problem

Medium

Created by

Rachel Pugh

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

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

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

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?