Algorithms are step-by-step plans for solving problems. They can be designed using pseudo-code and flowcharts.
What is an algorithm?
A set of steps to solve a problem
Software that analyses data
A hardware device that stores data
What is pseudo-code?
A diagrammatic representation of a set of instructions
An algorithm written out in words
A very specific programming language used by all computers
What is meant by language independent?
The code can be run on its own
The algorithm cannot be written in a programming language
The algorithm can be written in any programming language
Which of the following would assign user input to a variable?
INPUT = myVar
myVar ← INPUT
INPUT ← myVar
What shape represents a decision in a flowchart?
What is decomposition?
Breaking code down once it has been run
Breaking a problem down into smaller, more manageable sections
Breaking a problem into subroutines
Which of these is an example of abstraction?
A photo of a cat
The London Underground map
Deciding what clothes to wear to a party
What is the purpose of a trace table?
To show the value of each variable while an algorithm is dry run
To show the value of each constant while a program is run
To show the value of each variable at the end of a program
In what two ways can algorithms be designed?
Using variables and data
Using inputs and outputs
Using pseudo-code and flowcharts
What is algorithmic efficiency?
How long it takes to run an algorithm and how much space is needed
How long it takes to design an algorithm
How long it takes to program an algorithm