NEW
Font size
S
M
L
XL
WorksheetsAQA GCSE Computer Science - 3.1.3 Binary Search
Total questions: 19
Worksheet time: 8mins
Name
Class
Date
1.
Which one of the algorithms is the best search algorithm?
a)
Binary Search
b)
Bubble Sort
c)
Denary Search
d)
Linear Sort
2.
Which searching algorithm is more effective when the list is sorted?
a)
Binary Search
b)
Linear Search
c)
Denary Search
d)
Binary Sort
3.
How does Binary Search work?
a)
Halves data, repeats
b)
Swaps data parts.
c)
One by One check
d)
Splits into doubles
4.
Which of the options are the most efficient with a large list?
a)
Binary Search
b)
Denary Search
c)
Merge search
d)
Linear Search
5.
What is a disadvantage of Binary search?
a)
List has to be sorted
b)
Ony lists less than 100
c)
Too slow
d)
List must be even
6.
What sorting method would be fastest for the average list?
a)
Binary Search
b)
Linear Search
c)
Denary Search
d)
They're all the same
7.
Which conditions favour Binary Search?
a)
Sorted List
b)
Unsorted List
c)
Long List
d)
C and D
8.
1,31,56,58, 64,66,70. To find 31, what is the first set of numbers left after binary search?
a)
1,31,56
b)
31,56,58
c)
58,64,66
d)
64,66,70
9.
A database has more than 1200 numbered records. What search algorithm is used?
a)
Binary Search
b)
Denary Search
c)
Merge Sort
d)
Bubble Sort
10.
Generally speaking, which is the most efficient searching algorithm?
a)
Binary Search
b)
Linear Search
c)
Denary Search
d)
Bubble Search
11.
Which is hardest to code?
a)
Binary Search
b)
Linear Search
c)
Linear Programming
d)
Python
12.
How does Linear Search work?
a)
Start at the beginning until you find the item you want
b)
Start from the end until you find the item you want
c)
Look for the item among the others
d)
Split the list of items in half
13.
What benefit does linear search have over binary search?
a)
The list can be unsorted
b)
It is easier to understand
c)
It is easier to learn
d)
You don't need to split the list
14.
What benefit does binary search have over linear search?
a)
It is more efficient
b)
It's easier to understand
c)
It can be done with less items
d)
It takes less time to prepare
15.
What characters can binary search be used for?
a)
Numbers and Alphabet, but not both together
b)
Only numbers
c)
Only alphabet
d)
All punctuation,numbers and alphabet
16.
1,17,34,67,69,91,102. To find 17, what is the first set of numbers left after binary search?
a)
1,17,34
b)
69
c)
69,91,102
d)
1,102,91
17.
In a list of 10 million items, how many would have to be examined using binary search?
a)
24
b)
100
c)
720
d)
10000
18.
How much of the list is discarded each time an item is examined by Binary Search?
a)
Half the list
b)
One number
c)
Two numbers
d)
Depends on the numbers
19.
What is the second step of the binary search algorithm
a)
discard half of the list
b)
swap the two haves
c)
check each half separately
d)
half them again, check all
Reset
