NEW
Font size
S
M
L
XL
WorksheetsSearch Algorithms
Total questions: 12
Worksheet time: 7mins
Name
Class
Date
1.
What is pseudocode?
a)
Simplified programming language, that is not a specific language
b)
Complicated programming language
c)
Simple programming language, which is linked to a specific language
d)
A type of cheese
2.
Bubble sort takes the first two values of a list, and swaps them if wrong?
a)
True
b)
False
3.
Merge Sort is?
a)
When a list is kept as one and compared
b)
List is split into 2 and merged together
c)
List is split into 2 and kept seperate
d)
Nothing
4.
An Insertion sort builds the final list two items at a time
a)
True
b)
False
5.
Which type of sort algorithm is this?
a)
Bubble
b)
Merge
c)
Insertion
6.
Which type of sort algorithm is this?
a)
Bubble
b)
Merge
c)
Insertion
7.
Which of these is NOT a Sort algorithm
a)
Binary
b)
Merge
c)
Bubble
d)
Insertion
8.
What does a searching algorithm do?
a)
Search through a set of data
b)
Save a set of data
c)
Help to organise data
9.
What would be needed if searching algorithms didn't exist?
a)
The data would need to be saved
b)
Each item of data would need to be looked at one by one, until the searched for data was found
c)
A new set of data to look at would be needed
10.
Which of these is a type of searching algorithm?
a)
Linear search
b)
Word search
c)
Search engine
11.
How many passes will a bubble sort go through?
a)
Only one pass
b)
Two passes
c)
Several passe - until the data is fully ordered
12.
Which of the following is NOT an advantage of a bubble sort?
a)
It is a very small and simple computer program
b)
There is only one task to perform
c)
It is very quick
Reset
