Binary Search & Linear Search

Binary Search & Linear Search

9th Grade

17 Qs

quiz-placeholder

Similar activities

IED Drawing review

IED Drawing review

9th - 12th Grade

20 Qs

Back to the Future Homework 2

Back to the Future Homework 2

9th Grade

12 Qs

Computer Science Principles Unit 1 Review

Computer Science Principles Unit 1 Review

9th - 12th Grade

17 Qs

Big Idea 2 Review

Big Idea 2 Review

9th - 12th Grade

20 Qs

Logic Gates

Logic Gates

9th - 12th Grade

14 Qs

9.1 Homework #3

9.1 Homework #3

9th Grade

20 Qs

B Words GCSE Computer Science

B Words GCSE Computer Science

1st - 10th Grade

15 Qs

Technology Innovations

Technology Innovations

5th - 12th Grade

20 Qs

Binary Search & Linear Search

Binary Search & Linear Search

Assessment

Quiz

Computers

9th Grade

Practice Problem

Medium

Created by

ahmed hassanein

Used 424+ times

FREE Resource

AI

Enhance your content in a minute

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

17 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Which type of lists or data sets are linear searching algorithms used for?

Unsorted lists or data sets
Sorted lists or data sets

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Which type of lists or data sets are binary searching algorithms used for?

Unsorted lists or data sets
Sorted lists or data sets

3.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Select the best description to explain what a linear search algorithm is.

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

4.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Select the best description to explain what a binary search algorithm is.

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

5.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

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

1
2
3
4

6.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

A binary search is to be performed on the list:
3  5  9  10  23
How many comparisons would it take to find number 9?

0-1
2-3
4-5
I can't find the number 9

7.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

A binary search is to be performed on the list:
1  5  10  13  48  68  100  101
How many comparisons would it take to find number 101?

0-1
1-2
3-4
4-5

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?