Searching and Sorting

Searching and Sorting

10th - 12th Grade

25 Qs

quiz-placeholder

Similar activities

Logika & Pemrograman (ID)

Logika & Pemrograman (ID)

10th Grade - Professional Development

20 Qs

Quiz ASJ

Quiz ASJ

12th Grade

20 Qs

Computer Science - X

Computer Science - X

8th - 10th Grade

20 Qs

Google

Google

7th - 12th Grade

20 Qs

Lecture Exercise Topic 1.3

Lecture Exercise Topic 1.3

12th Grade

21 Qs

Types of Computers

Types of Computers

10th Grade

20 Qs

Software

Software

10th Grade

20 Qs

แบบทดสอบบทที่ 1 เรื่อง ข้อมูลมีคุณค่า ม.5

แบบทดสอบบทที่ 1 เรื่อง ข้อมูลมีคุณค่า ม.5

10th Grade

20 Qs

Searching and Sorting

Searching and Sorting

Assessment

Quiz

Computers

10th - 12th Grade

Medium

Created by

Carol Luce

Used 26+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which type of lists or arrays are linear search algorithms typically used for?

Unsorted

Sorted

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

A binary search algorithm will ONLY work on a list which is in order.

True

False

3.

MULTIPLE CHOICE QUESTION

30 sec • 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

30 sec • 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

After checking if 9 is greater than 11 it will stop searching.

The list is not in numerical order

The first pass will take the first half because 13 is greater than 9, so the second half containing the 9 will be eliminated.

5.

MULTIPLE CHOICE QUESTION

45 sec • 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

45 sec • 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

30 sec • 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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?

Discover more resources for Computers