WorksheetsAQA GCSE Computer Science - 3.1.1 Representing Algorithms
Total questions: 19
Worksheet time: 6mins
Name
Class
Date
1.
what are the three constructs used to write algorithms in pseudocode
a)
sequence, selection, iteration
b)
beginning , middle, end
c)
name, option, variable
d)
userinput, total, option
2.
What is a selection
a)
using an if else or then statement
b)
a variable
c)
a choice
d)
a menu
3.
what is a sequence
a)
writing steps in the order they need to happen
b)
list of numbers
c)
boolean variables
d)
a list
4.
what is a definite iteration
a)
uses a for loop so you can execute a task a number of times
b)
control, alt, delete
c)
flowchart element
d)
input or output
5.
what is a indefinite iteration
a)
using a until loop
b)
all other while statements don’t work in the code
c)
something that is not definite
d)
waste of time
6.
what is a condition contolled loop
a)
a while or endwhile loop
b)
a loop that is contolled
c)
a placebo loop
d)
a loop that is not based on conditions
7.
what does a while loop do
a)
a while loop allows code to be executedbased on a given Boolean condition
b)
loops
c)
repeats once and ends
d)
never ends
8.
what is an if statement
a)
performs a set of instructions if it is true
b)
a statement with an if
c)
a side comment
d)
only pseudocode
9.
whats an else statement
a)
performs a set of insttructions if the previous statement is false
b)
a statement with an else
c)
only pseudocode
d)
a side comment
10.
whats an elif statement
a)
an elif statment lets you check if multiple expressions are true
b)
a side comment
c)
a statement with an elif
d)
only pseudocde
11.
what happens if the user puts end before the while statement
a)
the loop wont be performed and will skip to the endehile statement
b)
crashes program
c)
shows syntax error
d)
restarts code from beginning
12.
what does a diamond indicate in a flowchart
a)
decision
b)
start/end
c)
connection between steps
d)
process
13.
what is an algorithm
a)
Step-by-step instructions used to solve a problem
b)
A chart showing the flow of a series of events
c)
A decision arrived at by following instructions
d)
A computer program that follows a chart
14.
what is decomposition
a)
breaking down a problem into smaller parts
b)
joining together multiple problems
c)
not doing anything to the problem
d)
making a problem more complex
15.
what is abstraction
a)
filtering out all irrelevant characteristics and unnecessary details
b)
adding to a problem
c)
looking for similarities
d)
finding characteristics
16.
Which of these is not computational thinking.
a)
iteration
b)
abstraction
c)
decomposition
d)
algorithmic thinking
17.
which of these cannot be an algorithm
a)
a code comment
b)
psuedocode
c)
code
d)
flowchart
18.
when can algorithms be used
a)
Any time to design solutions to problems
b)
Only with computers
c)
Only when programming
d)
Only with flowcharts
19.
What does an arrow represent in a flow chart
a)
Data flow
b)
Stop
c)
Start
d)
Decision Making
100 %
