What is an algorithm?
- A broken computer
- Only a password
- An ordered set of steps to solve a problem
- A type of screen
Answer and explanation
An ordered set of steps to solve a problem
An ordered set of steps to solve a problem
Subjects
Algorithms & logic
Choose questions individually, practise online, or create a worksheet with matching answers. Counts include generated variants, not only authored originals.
Make a worksheet1,926 question instances
Sample exercises
Which instruction represents repetition?
- Stop immediately
- Repeat these steps five times
- Choose one colour
- Start once
Answer and explanation
Repeat these steps five times
Repeat these steps five times
Write an algorithm for arranging three books from shortest to tallest.
Answer and explanation
Compare heights, put the shortest first, then the shorter of the remaining two, then the tallest. Accept any precise method that sorts all three.
Compare heights, put the shortest first, then the shorter of the remaining two, then the tallest. Accept any precise method that sorts all three.
Computing foundations: which term fits this description? A finite, ordered method for carrying out a task or solving a problem.
- Input
- Parameter
- Boolean
- Algorithm
Answer and explanation
Algorithm
Algorithm: A finite, ordered method for carrying out a task or solving a problem.
Computing foundations: which term fits this description? A named location or binding used to refer to a value in a program.
- Argument
- String
- Logic error
- Variable
Answer and explanation
Variable
Variable: A named location or binding used to refer to a value in a program.
Computing foundations: which term fits this description? A value intended not to change within the relevant program context.
- Constant
- Return value
- Integer
- Flowchart
Answer and explanation
Constant
Constant: A value intended not to change within the relevant program context.
Study notes
Zero-based array indexing
An index of zero refers to the first position, not the second.
Grades 6–9Nested loops
This product applies when the inner count is constant for each outer iteration.
Grades 8–12Trace a loop with a step
The upper limit is inclusive in the pseudocode here.
Grades 6–10Algorithms & logic · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 6–8Algorithms & logic · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 9–10Algorithms & logic · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 11–12Computing foundations
20 key concepts, retrieval questions and a learning checkpoint.
Grades 5–10Computing foundations · quick reference
Trace code using a table of variable values. Do not execute unknown code to answer a worksheet question.
Grades 5–10Advanced computing concepts
20 key concepts, retrieval questions and a learning checkpoint.
Grades 9–12Advanced computing concepts · quick reference
An algorithm’s complexity describes growth, not its exact runtime on every computer. Binary search requires an appropriate ordered collection.
Grades 9–12Algorithms without a computer
An algorithm is a clear sequence of instructions for a task.
Grades 3–6Algorithms without a computer · revision card
An algorithm is a clear sequence of instructions for a task.
Grades 3–6Python-style code tracing
Use a small table of variable values after each statement.
Grades 7–11Python-style code tracing · revision card
Use a small table of variable values after each statement.
Grades 7–11Python lists and sequence tracing
Python lists use zero-based indexing; these tasks use the displayed list only.
Grades 7–10Python lists and sequence tracing · Revision card
Python lists use zero-based indexing; these tasks use the displayed list only.
Grades 7–10Algorithm tracing and useful tests
These examples use plain pseudocode; inclusive bounds are stated explicitly.
Grades 6–10Algorithm tracing and useful tests · Revision card
These examples use plain pseudocode; inclusive bounds are stated explicitly.
Grades 6–10Trace algorithms step by step
Use explicit starting values and loop boundaries.
Grades 6–10Trace algorithms step by step · Revision sheet
Use explicit starting values and loop boundaries.
Grades 6–10Related courses
Computer science4 lessons
Python programming foundations
Learn core Python concepts with paper-based reasoning and small code-reading tasks.
32 quiz questions · University
Computer science4 lessons
Web development foundations
Study HTML, CSS, JavaScript and accessible web structure without a paid bootcamp.
32 quiz questions · University
Computer science4 lessons
SQL and relational databases
Learn tables, queries, joins and data modelling with original exercises.
32 quiz questions · University
Computer science4 lessons
Data science foundations
Work through data cleaning, visualization, modelling and interpretation.
32 quiz questions · University
Computer science4 lessons
Cybersecurity foundations
Study defensive security, privacy and risk management without offensive exploitation instructions.
32 quiz questions · University
Computer science4 lessons
Spreadsheet skills
Learn formulas, references, cleaning and charts for practical study and office work.
32 quiz questions · University