Search & Sort Algorithms

Search & Sort Algorithms

7th - 11th Grade

18 Qs

quiz-placeholder

Similar activities

APCSA Search & Sort

APCSA Search & Sort

9th - 12th Grade

15 Qs

Year 11 Revision - paper 2

Year 11 Revision - paper 2

11th Grade

14 Qs

Algorithms

Algorithms

11th Grade

18 Qs

AP Computer Science Principles Unit 6

AP Computer Science Principles Unit 6

9th - 12th Grade

15 Qs

AQA GCSE Computer Science - 3.1.3 Binary Search

AQA GCSE Computer Science - 3.1.3 Binary Search

8th - 10th Grade

19 Qs

Searches

Searches

9th Grade

15 Qs

Algorithms Computer Science

Algorithms Computer Science

10th Grade

17 Qs

KS4 (01) Ethics, Legal, and Searching Algorithms

KS4 (01) Ethics, Legal, and Searching Algorithms

8th - 10th Grade

15 Qs

Search & Sort Algorithms

Search & Sort Algorithms

Assessment

Quiz

Computers

7th - 11th Grade

Medium

Created by

Mr Abbas

Used 838+ times

FREE Resource

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
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?