Font size
S
M
L
XL
WorksheetsMr Orme's Algorithms Quiz
Total questions: 95
Worksheet time: 48mins
Name
Class
Date
1.
What is an algorithm?
a)
Patterns and trends used to solve a problem
b)
A set of step-by-step instructions to resolve a problem
c)
A programming language
2.
What are algorithms used for?
a)
To plan out the solution to a problem
b)
As a platform to program a solution
c)
To test a solution to a problem
3.
How can an algorithm be represented?
a)
As a flowchart
b)
As pseudocode
c)
As a flowchart or pseudocode
4.
What is a flowchart?
a)
A diagram that represents a set of instructions
b)
A high-level language that has specific syntax
c)
A way of describing a set of instructions that doesn�t use specific syntax
5.
What is the correct symbol for a process instruction in a flowchart?
a)
A rectangle
b)
A parallelogram (wonky rectangle)
c)
A square
6.
What is the correct symbol for an input in a flowchart?
a)
A parallelogram (wonky rectangle)
b)
A rectangle
c)
A square
7.
What is the correct symbol for an output in a flowchart?
a)
A parallelogram (wonky rectangle)
b)
A rectangle
c)
A diamond
8.
What links each instruction in a flowchart?
a)
A line
b)
A double line
c)
An arrow
9.
What is the correct symbol for a decision in a flowchart?
a)
A rectangle
b)
A diamond
c)
A square
10.
What is pseudocode?
a)
A high-level language that has specific syntax
b)
A way of describing a set of instructions that doesn�t use specific syntax
c)
A diagram that represents a set of instructions
11.
What is evaluation?
a)
Evaluation is the process that allows us to find a problem with our hardware
b)
Evaluation is the process that allows us to break down a problem
c)
Evaluation is the process that allows us to make sure our solution is correct
12.
Why is it important to evaluate?
a)
To ensure that a solution is as good as it can be
b)
To prove that the solution has been tested
c)
That it is inefficient
13.
How may a solution be faulty?
a)
It may be incomplete
b)
It may not be decomposed
c)
It may be incomplete and/or not decomposed
14.
What is said when a problem isn't understood?
a)
That it isn't fully decomposed
b)
That it is incomplete
c)
That it is inefficient
15.
What is said when a solution doesn't fully solve the problem?
a)
It isn't fully decomposed
b)
It is incomplete
c)
It is inefficient
16.
What is said when a solution contains many unnecessary steps?
a)
It isn't fully decomposed
b)
It is incomplete
c)
It is inefficient
17.
Which of the following is an example of an efficient solution?
a)
Heating some soup, waiting until it is boiled then buttering some bread
b)
Heating some soup and buttering bread whilst the soup is heating
c)
Buttering bread then heating soup afterwards
18.
Which of the following is also an example of an efficient solution?
a)
Carrying a pile of books and placing them on a shelf all in one go
b)
Carrying the books one at a time and placing them on a shelf
c)
Moving a pile of books three at a time and placing them on a shelf
19.
Working through an algorithm with pen and paper is known as what?
a)
Checklist
b)
A dry run
c)
Evaluation
20.
What happens if an evaluation isn't done?
a)
The solution may be incomplete
b)
The solution may be too hard to understand
c)
The solution may be too large
21.
What should be considered when designing an algorithm?
a)
If there is more than one way of solving the problem
b)
If the correct hardware is being used
c)
If the correct software is being used
22.
What are the two main ways that algorithms can be designed?
a)
Images or videos
b)
In pseudocode or as a flowchart
c)
By hardware or software
23.
What is pseudocode?
a)
A way of describing a set of instructions in text form
b)
A specific programming language that all computers use
c)
A diagrammatic representation of a set of instructions
24.
What is a flowchart?
a)
A flowchart is a text-based way of designing an algorithm
b)
A flowchart is a specific programming language
c)
A flowchart is a diagram that represents a set of instructions
25.
How are symbols connected together in a flowchart?
a)
Symbols do not get connected together in a flowchart
b)
With lines and an arrow to show the direction of flow
c)
By numbers
26.
How would a condition loop be created when writing pseudocode?
a)
With a FOR loop
b)
With a WHILE loop or a REPEAT-UNTIL loop
c)
With a REPEAT-UNTIL loop
27.
When can algorithms be used?
a)
Only with computers
b)
To design a solution to any problem
c)
For programming
28.
What does a searching algorithm do?
a)
Search through a set of data
b)
Save a set of data
c)
Help to organise data
29.
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
30.
Which of these is a type of searching algorithm?
a)
Serial search
b)
Word search
c)
Search engine
31.
What does a serial 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
32.
What is an advantage of a serial search?
a)
It is very quick
b)
It only works with ordered lists
c)
It is a simple algorithm
33.
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
34.
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
35.
Which search algorithm would be best to use with ordered data?
a)
A binary search
b)
Either binary search or a serial search
c)
A serial search
36.
What is an advantage of a binary search
a)
It is very quick
b)
It only works with ordered lists
c)
It is a simple algorithm
37.
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
38.
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
39.
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
40.
How many passes will a bubble sort go through?
a)
Only one pass
b)
Two passes
c)
Several passes - until the data is fully ordered
41.
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
42.
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
43.
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
44.
What does a bucket sort do?
a)
Finds an item of data in a list
b)
Separates a list of data into different collections of data which are sorted and gathered back into a list
c)
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
45.
Which of the following is a disadvantage of a bucket sort?
a)
It takes a long time to run
b)
It is more complicated than a bubble sort
c)
There is only one task to perform
46.
Which of the following is an advantage of a bucket sort?
a)
It takes a long time to run
b)
It is quicker to run than a bubble sort
c)
It is simpler than a bubble sort
47.
Which of the following is NOT a type of sorting algorithm?
a)
Merge sort
b)
Insertion sort
c)
Long sort
48.
What three building blocks are used when designing algorithms?
a)
Sequencing, programming, iteration
b)
Sequencing, selection, iteration
c)
Sequencing, selection, programming
49.
What is sequencing?
a)
The order in which steps are carried out in an algorithm
b)
The order in which we think computationally
c)
The process of repeating a number of steps in an algorithm
50.
Why is sequencing important?
a)
To ensure the algorithm is kept to a reasonable length
b)
To ensure the algorithm functions as intended
c)
To ensure the algorithm is efficient
51.
What might happen if the sequence is wrong?
a)
The algorithm may be overly long
b)
The algorithm may be inefficient
c)
The algorithm may produce unexpected results
52.
Which of the following contains a correct sequence to make a cup of tea?
a)
Add water to kettle, boil water, add hot water to cup
b)
Add hot water to cup, add water to kettle, boil water
c)
Boil water, add hot water to cup, add water to kettle
53.
Which of the following contains the correct sequence to draw a square?
a)
Draw a 1 cm line, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees
b)
Draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees
c)
Draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line
54.
Which of the following contains an INCORRECT sequence when getting dressed to go out?
a)
Put on socks, put on shoes, put on coat
b)
Put on coat, put on shoes, put on socks
c)
Put on socks, put on coat, put on shoes
55.
Which of the following contains the correct sequence for making jam on toast?
a)
Put bread in toaster, spread jam on toast, remove toast when done, spread butter on toast
b)
Put bread in toaster, remove toast when done, spread butter on toast, spread jam on toast
c)
Spread butter on toast, spread jam on toast, put bread in toaster, remove toast when done
56.
How is sequencing represented in a flowchart?
a)
With sentences that look like a programming language
b)
As a series of boxes that follow each other, linked by arrows
c)
As a series of diamond shaped boxes that follow each other, linked by arrows
57.
How is sequencing represented in pseudocode?
a)
Each step of the algorithm is written on a line of its own, in sequence
b)
Each step of the algorithm is explained in a diagram
c)
All the steps of the algorithm is written on the same line
58.
What is selection?
a)
A set of steps to follow
b)
A path through a solution
c)
A decision
59.
Why is selection important?
a)
Selection allows us to include more than one path through a solution
b)
Selection allows us to repeat steps in a solution
c)
Selection allows us make our solution more efficient
60.
How many paths can be followed from a decision?
a)
As many as is needed
b)
Three
c)
Two
61.
In pseudocode how is a decision represented?
a)
IF-THEN-ELSE
b)
IF-OTHERWISE
c)
WHEN-DO
62.
Which of the instructions IF, THEN and ELSE represents a question?
a)
IF
b)
THEN
c)
ELSE
63.
Which of the instructions IF, THEN and ELSE points to what to do if the answer to the question is FALSE?
a)
IF
b)
THEN
c)
ELSE
64.
Which of the instructions IF, THEN and ELSE points to what to do if the answer to the question is TRUE?
a)
IF
b)
THEN
c)
ELSE
65.
What does the instruction ELSE IF allow?
a)
Just one path through an algorithm
b)
More than two paths through an algorithm
c)
Only two paths through an algorithm
66.
Which of the following instructions represent questions?
a)
ELSE and ELSE IF
b)
ELSE and THEN
c)
ELSE IF and THEN
67.
What is iteration?
a)
Repeating steps in an algorithm
b)
A decision in an algorithm
c)
An error in an algorithm
68.
Why is iteration important?
a)
It allows us to choose one of several paths through an algorithm
b)
It allows us to simplify an algorithm by removing unnecessary steps
c)
It allows more steps to be included in an algorithm
69.
What is another name for iteration?
a)
Loop
b)
Sequence
c)
Selection
70.
What is a condition?
a)
A decision
b)
A situation that is checked every time iteration occurs
c)
A type of iteration
71.
What is meant by testing a condition?
a)
Checking to see if a condition has been met
b)
Checking which path to take through the solution
c)
Checking how many steps to repeat
72.
How is iteration represented in pseudocode?
a)
IF-THEN-ELSE
b)
IF-THEN-OTHERWISE
c)
REPEAT-UNTIL
73.
How is iteration represented in a flowchart?
a)
As a process
b)
As an input
c)
As a decision
74.
What is a counter used for in iteration?
a)
To keep track of how many different steps have been completed
b)
To keep track of how many times the solution has iterated
c)
Keep track of how many steps to repeat
75.
What is logical reasoning?
a)
Counting rules in an algorithm
b)
Using steps to solve problems
c)
Using rules to solve problems
76.
What is logical reasoning used for?
a)
To make decisions
b)
To iterate steps
c)
To predict the outcome of an algorithm
77.
Why is logical reasoning used?
a)
To compare the effectiveness of different algorithms to solve a problem
b)
To count steps in an algorithm
c)
To determine where to start in an algorithm
78.
Which symbol means 'greater than'?
a)
>
b)
=
c)
>=
79.
Which symbol means 'greater than or equal to'?
a)
>
b)
=
c)
>=
80.
Which symbol means 'equal to'?
a)
>
b)
=
c)
>=
81.
Which condition would confirm that someone 17 or over is able to drive a car?
a)
age = 17
b)
age > 17
c)
age >= 17
82.
Which condition would confirm that someone 12 or over is able to watch a 12 rated film?
a)
age >= 12
b)
age = 12
c)
age > 12
83.
Which condition would confirm that only someone 21 and over can drive a mini-bus?
a)
age >= 21
b)
age > 21
c)
age = 22
84.
Which condition would say that only those older than 14 can watch a 15 rated film?
a)
age = 15
b)
age >=14
c)
age > 14
85.
Which of the following would represent a decision in a flow chart?
a)
Put teabag in cup
b)
Boil Water
c)
Wait for water to boil
d)
Is water boiled?
86.
Which of the following would represent a pause (represent by a wonky rectangle - parallelogram) in a flow chart?
a)
Put teabag in cup
b)
Boil Water
c)
Wait for water to boil
d)
Is water boiled?
87.
Which of the following would represent an input in a flow chart?
a)
Put teabag in cup
b)
Drink tea
c)
Wait for water to boil
d)
Is water boiled?
88.
In a flow chart, what does a oval mean?
a)
Start or end
b)
Decision
c)
Process
d)
Input or Output
89.
In a flow chart, what does a rectangle mean?
a)
Start or end
b)
Decision
c)
Process
d)
Input or Output
90.
In a flow chart, what does a wonky rectangle (parrellelogram) mean?
a)
Start or end
b)
Decision
c)
Process
d)
Input or Output
91.
In a flow chart, what does a diamond mean?
a)
Start or end
b)
Decision
c)
Process
d)
Input or Output
92.
In computer programming, what is a 'loop'?
a)
Something that is used to end a program
b)
Something that is continually repeated until a certain condition is reached
c)
Something that tells a program what to do
d)
Something that is required to load a program
93.
Which describes an algorithm?
a)
Set of step by step instructions to complete a task or solve a problem
b)
A visual diagram to represent an algorithm
c)
Re-using a chunk of code.
94.
Which describes a flow chart?
a)
Set of step by step instructions to complete a task or solve a problem
b)
A visual diagram to represent an algorithm
c)
Re-using a chunk of code.
95.
Which describes a procedure?
a)
Set of step by step instructions to complete a task or solve a problem
b)
A visual diagram to represent an algorithm
c)
Re-using a chunk of code.
Reset
