Search & Sort Algorithms

Search & Sort Algorithms

7th - 11th Grade

18 Qs

quiz-placeholder

Similar activities

A számítógép felépítése

A számítógép felépítése

7th - 8th Grade

14 Qs

HTML

HTML

8th - 12th Grade

15 Qs

Componentes de una computadora

Componentes de una computadora

6th - 8th Grade

20 Qs

Asesmen Sumatif Kelas 7 Semester Genap

Asesmen Sumatif Kelas 7 Semester Genap

7th Grade

17 Qs

Traffic Light Project Quiz

Traffic Light Project Quiz

9th Grade

17 Qs

Word

Word

3rd - 7th Grade

15 Qs

Networking Quiz

Networking Quiz

8th - 9th Grade

15 Qs

Arduino

Arduino

7th - 9th Grade

15 Qs

Search & Sort Algorithms

Search & Sort Algorithms

Assessment

Quiz

Computers

7th - 11th Grade

Practice Problem

Medium

Created by

Mr Abbas

Used 857+ times

FREE Resource

AI

Enhance your content in a minute

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

18 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which type of lists are linear search algorithms used for?

Unsorted lists
Sorted lists

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A binary search algorithm will only work on a list which is in order. True or False

True
False

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

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

It takes a long time to find the item.
It is a simple algorithm to write.
It is more efficient than a binary search.
It is a complex algorithm to write.

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Using a binary search why will the number 9 never be found in the following list:
11, 8, 13, 9, 7, 3

It does not work on numbers
It only works on letters
The list is not in order

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following descriptions best describes a linear search:

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, 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.

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following best describes a binary search:

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, 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.

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A linear search is to be performed on the list:
12, 6, 8, 1, 3
How many searches would it take to find the number 1?

1
2
3
4

Create a free account and access millions of resources

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?