Common Algorithms

Common Algorithms

9th - 12th Grade

25 Qs

quiz-placeholder

Similar activities

2.1 Algorithms

2.1 Algorithms

10th - 12th Grade

20 Qs

laila comel tummy busuk

laila comel tummy busuk

9th - 12th Grade

20 Qs

Informatika Bab 2 Berpikir Komputasional

Informatika Bab 2 Berpikir Komputasional

10th Grade

20 Qs

ASK T3 Bab 3 Algoritma

ASK T3 Bab 3 Algoritma

9th Grade

20 Qs

Sort and Search Algorithms

Sort and Search Algorithms

9th Grade

25 Qs

Algorithm questions

Algorithm questions

12th Grade - University

20 Qs

informatika

informatika

10th Grade

20 Qs

Intro to Algorithms

Intro to Algorithms

9th - 12th Grade

23 Qs

Common Algorithms

Common Algorithms

Assessment

Quiz

Fun, Computers, Mathematics

9th - 12th Grade

Hard

Created by

Mohammed Rahman

Used 21+ times

FREE Resource

25 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

1 min • 1 pt

A linear search does not need your data set to be ______.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When is a linear search a good algorithm to use?

If your data set is very large

If your data set is sorted in order

If your data set is small

If your data set is made up of irrational numbers

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When would you get a best case scenario for a linear search?

When your data set is small

When your data set is large

When your search item is near the beginning of the list

When the search item is in the middle of the list

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When would you get the best case scenario for a binary search?

When your list is small

When your list is unsorted

When your search item is in the beginning of the list

When your search item is exactly in the middle of the list

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of these statements is true for binary search?

It looks at each data item in order sequentially

It is very good if your data set is very small

It requires your data set to be sorted

It only works if your data set is made out of 0s and 1s

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of these is a disadvantage of linear search?

It does not work on unsorted data sets

It is very inefficient on large data sets

It is very time consuming on small data sets

It requires twice as much memory as binary search

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the worst case scenario for a linear search?

When the data set is large and your search item is in the middle of the list

When the data set is small and the search item is at the beginning of the list

When the data set is made up of curved geometric shapes

-OWEN D

When the data set is large and the search item is at the end of the list

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?