Search Header Logo

GCSE J277 - 2.1.3 - Searching Algorithms

Authored by Paul Greenwood

Computers

7th Grade

Used 112+ times

GCSE J277 - 2.1.3 - Searching Algorithms
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A binary search works by

Only searching 0 and 1
Spliting data in half each time when searching
Checking every item sequentially
Randomly searching for an item

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A linear search works by

Only searching 0 and 1
Spliting data in half each time when searching
Checking every item sequentially
Randomly searching for an item

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What formula is needed for a binary search

n + 1 / 2
(n + 1) / 2
n / 2 + 1
n + (1 / 2)

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In this list, what is the first item checked in a binary search: 1, 3, 5, 6, 7, 8, 9

1
6
8
9

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In this list, what is the first item checked in a linear search: 1, 3, 5, 6, 7, 8, 9

1
6
8
9

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What's the minimum number of searchings using a linear search on: 1, 3, 5, 6, 7, 8, 9

1
2
3
7

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What's the minimum number of searchings using a binary search on: 1, 3, 5, 6, 7, 8, 9

1
2
3
7

Access all questions and much more by creating a free account

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?