NEW
Font size
S
M
L
XL
WorksheetsAlgorithms
Total questions: 32
Worksheet time: 16mins
Name
Class
Date
1.
What is computational thinking?
a)
It allows you to break down a large / complex problem into smaller parts.
b)
It is thinking like a robot
c)
It is being able to bake a cake.
d)
It is creating a coding solution to a problem.
2.
What are the three key parts of computational thinking?
a)
Programming, flowcharts and pseudo code
b)
Abstraction, decomposition and algorithm
c)
Input, processing and output
d)
Patterns, shapes and numbers
3.
What is abstraction?
a)
A painting
b)
A programming language
c)
This means focusing on the important details and ignoring the irrelevant information
d)
Abstraction is the breaking down of a big problem into smaller parts.
4.
What does decomposition mean?
a)
focuses on the important information only, ignoring irrelevant detail
b)
Step by step instructions on solving a problem.
c)
Thinking like a computer
d)
This is the breaking down of a complex problem into smaller parts
5.
What is an algorithm?
a)
A sequence of instructions on how to solve a problem.
b)
The breaking down of a problem into smaller parts.
c)
Focusing on important parts and ignoring the irrelevant details
d)
The recipe for a cake
6.
What are the two main ways that we represent an algorithm?
a)
By drawing pictures
b)
Using flowcharts and pseudo code
c)
Using python and small basic
d)
Using Scratch and python
7.
What is a flowchart?
a)
A visual representation of an algorithm using symbols
b)
Using 'fake code' to plan an algorithm
c)
Using a programming language to show an algorithm
d)
Uisng different types of charts to show an algorithm
8.
What does the following symbol represent in a flowchart?
a)
An input
b)
Start
c)
End
d)
A process
9.
What does the following flowchart symbol represent?
a)
A process
b)
An output
c)
A decision (choice)
d)
End
10.
What does the following flowchart symbol represent?
a)
Input / Output
b)
Start of flowchart
c)
A process
d)
End
11.
What does the following flowchart symbol represent?
a)
Process
b)
Input
c)
Start / End
d)
Sub-process
12.
What does the following flowchart symbol represent?
a)
A process
b)
Input / Output
c)
Start / End
d)
A sub-process
13.
What does a searching algorithm do?
a)
Search through a set of data
b)
Save a set of data
c)
Help to organise data
14.
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
15.
Which of these is a type of searching algorithm?
a)
Linear search
b)
Word search
c)
Search engine
16.
What does a linear search do?
a)
Looks at the first item of data, then each one in turn, until it finds the data item requested
b)
Organises the data into alphabetical order
c)
Splits the data until the requested data is found
17.
What is an advantage of a linear search?
a)
It is very quick
b)
It only works with ordered lists
c)
It is a simple algorithm
18.
Which of the following is NOT an advantage of a serial search?
a)
It can be used on any set of data regardless of type
b)
It is the quickest search to use
c)
It is a simple algorithm, so it is easy to write a computer program to carry it out
19.
What does a binary search do?
a)
Looks at the first item of data, then each one in turn, until it finds the data item requested
b)
Converts all the data into binary
c)
Takes the data and splits it in half repeatedly until it finds the data item requested
20.
Which search algorithm would be best to use with ordered data?
a)
A binary search
b)
Either binary search or a linear search
c)
A linear search
21.
What is an advantage of a binary search
a)
It's very quick
b)
It only works with ordered lists
c)
It is a simple algorithm
22.
What is the biggest disadvantage of a binary search?
a)
It is slow
b)
It can only be used if the data is sorted into an order
c)
It takes the data and keeps dividing it in half until it finds the item it is looking for
23.
What does a sorting algorithm do?
a)
Finds an item of data in a set of data
b)
Saves a set of data
c)
Puts a list of items into order
24.
Which of the following is not a sorting algorithm?
a)
Bubble Sort
b)
Long Sort
c)
Insertion Sort
25.
What does a bubble sort do?
a)
Sorts a list by comparing two items that are side by side, to see which is out of order
b)
Separates a list of data into different collections of data, before sorting and gathering back into a list
c)
Finds an item of data in a list
26.
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
27.
Why does a bubble sort do a final pass even when the data is in the correct order?
a)
To save the data
b)
It does not recognise that the data is in order until the final pass requires no changes
c)
It needs to do this to put the data back in to a list
28.
Which of the following is an advantage of a bubble sort?
a)
It is a very small and simple computer program
b)
It takes a very long time to run
c)
It is very quick
29.
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
30.
What does an insertion sort do?
a)
Separates a list of data into different collections of data which are sorted and gathered back into a list
b)
Goes through a list of data a number of times and compares two items that are side by side to each other to see which is out of order
c)
Goes through a list, comparing two items that are side by side, and continues to move one value until it is in the correct place.
31.
Which of the following is an advantage of a insertion sort when compared with a bubble sort?
a)
It is quicker than a bubble sort algorithm
b)
It is simpler than a bubble sort algorithm
c)
There is no advantage.
32.
How many passes will an insertion sort go through?
a)
Only one pass
b)
Two passes
c)
Several passes - until the data is fully ordered
Reset
