How many comparisons would it take to find the value 7 in the following list using a linear search? [1, 4, 7, 8, 5, 2, 9]

Not possible, list is out of order

How many comparisons would it take to find the value 2 in the following list using a binary search? [1, 4, 7, 8, 5, 2, 9]

Not possible, list is out of order

Simplified programming language, that is not a specific language

Complicated programming language

Simple programming language, which is linked to a specific language

List is split into 2 and merged together

When a list is kept as one and compared

List is split into 2 and kept seperate

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

Each item of data would need to be looked at one by one, until the searched for data was found

The data would need to be saved

A new set of data to look at would be needed

How many passes will a bubble sort go through?

Several passe - until the data is fully ordered

Which of the following is NOT an advantage of a bubble sort?

It is a very small and simple computer program

There is only one task to perform

What is decomposition?

Breaking down of a problem into smaller chunks

Breaking smaller chunks of problems into one large problem

What is a binary search?

The list is split into 2 and compared

The first 2 values are compared and moved

Which one of the following is an advantage of a linear search?

It is a simple algorithm to write.

It takes a long time to find the item.

It is more efficient than a binary search.

It is a complex algorithm to write.

Which of the following descriptions best describes a linear search:

Elements do not need to be in order, check each item in turn.

Put the elements in order, check each item in turn

Put the elements in order, compare with the middle value, split the list in order and repeat

Elements do not need to be in order, compare to the middle value, split the list in order and repeat.

Which of the following best describes a binary search:

Put the elements in order, compare with the middle value, split the list in order and repeat

Put the elements in order, check each item in turn.

Elements do not need to be in order, check each item in turn.

Elements do not need to be in order, compare to the middle value, split the list in order and repeat.

Which of the following describes a merge sort?

List is split in two and merged together in order

List is split into 2 and kept seperate

Identify the description of a linear search

Elements do not need to be in order, check each item in turn

Put the elements in order, check each item in turn

Put the elements in order, compare to the middle value, split the list in order and repeat

Elements do not need to be in order, compare to the middle value, split the list in order and repeat

Search Algorithms

Authored by sani baharom

Computers

9th - 12th Grade

Used 1+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

60 questions

Show all answers

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

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.

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.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

True

False

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the maximum number of comparisons a linear search algorithm could make while searching a 100 item list?

100

101

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the average number of comparisons for a successful linear search on a list with 100 items?

101

100

50.5

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the maximum number of comparisons required to find a value in a list of 20 items using a binary search?

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Popular Resources on Wayground

15 questions

Fractions on a Number Line

Quiz

•

3rd Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

$fractions$

22 questions

fractions

Quiz

•

3rd Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

15 questions

Equivalent Fractions

Quiz

•

4th Grade

20 questions

Figurative Language Review

Quiz

•

6th Grade

Discover more resources for Computers

18 questions

[AP CSP] JavaScript Programming Lesson 2025-2026

Lesson

•

9th - 12th Grade

10 questions

Exploring Digital Citizenship Essentials

Interactive video

•

6th - 10th Grade

Search Algorithms

An algorithm is...

Which of the following is the best description of the linear search algorithm?

Which of the following is the best description of the binary search algorithm?

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

What is the maximum number of comparisons a linear search algorithm could make while searching a 100 item list?

What is the average number of comparisons for a successful linear search on a list with 100 items?

What is the maximum number of comparisons required to find a value in a list of 20 items using a binary search?

How many comparisons would it take to find the value 7 in the following list using a linear search?[1, 4, 7, 8, 5, 2, 9]

How many comparisons would it take to find the value 2 in the following list using a binary search?[1, 4, 7, 8, 5, 2, 9]

How many comparisons would it take to find the value 2 in the following list using a binary search?[1, 2, 4, 5, 7, 8, 9]

Access all questions and much more by creating a free account

Popular Resources on Wayground

Discover more resources for Computers

How many comparisons would it take to find the value 7 in the following list using a linear search?
[1, 4, 7, 8, 5, 2, 9]

How many comparisons would it take to find the value 2 in the following list using a binary search?
[1, 4, 7, 8, 5, 2, 9]

How many comparisons would it take to find the value 2 in the following list using a binary search?
[1, 2, 4, 5, 7, 8, 9]