Search Algorithms

Search Algorithms

9th Grade

9 Qs

quiz-placeholder

Similar activities

C++ Quiz 5: Searching and Sorting Algorithms

C++ Quiz 5: Searching and Sorting Algorithms

7th - 12th Grade

9 Qs

AP Computer Science Principles - Unit 6: Algorithms

AP Computer Science Principles - Unit 6: Algorithms

9th - 12th Grade

10 Qs

CS Edexcel 1.2c - Linear and Binary Search

CS Edexcel 1.2c - Linear and Binary Search

9th - 10th Grade

10 Qs

Computing XDDD

Computing XDDD

KG - University

10 Qs

ASK T3 BAB 3

ASK T3 BAB 3

9th Grade

10 Qs

ALGORITMA BAB 3 T3

ALGORITMA BAB 3 T3

9th Grade

13 Qs

Binary Hex Decimal

Binary Hex Decimal

7th - 12th Grade

12 Qs

Search Algorithms

Search Algorithms

9th - 12th Grade

10 Qs

Search Algorithms

Search Algorithms

Assessment

Quiz

Computers

9th Grade

Hard

Created by

J Giblin

Used 139+ times

FREE Resource

9 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Linear Search is faster than Binary search
TRUE
FALSE
It depends on the scenario

2.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Where can Linear Search be performed?
On letters
On numbers
Both
None of these

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which values can Binary Search be performed on?
Letters
Numbers
Ordered Numbers
Ordered Letters

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

On average, which searching algorithm is more efficient?
Binary Search
Linear Search

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many linear searches will it take to find the value 7 in the list [1,4,8,7,10,28]?
2
3
4
5

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Bubble sort takes the first two values of a list, and swaps them if wrong?
True
False

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many binary searches will it take to find the value 7 in the list [1,4,7,8,10,28]?
0
1
2
3

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many binary searches will it take to find the value 10 in the list [1,4,9,10,11]?
0
1
2
3

9.

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.