Read each term where it’s used
In Augment’s notes, a marked term shows its definition when you hover or tap it, and each page ends with the terms it introduces.
In Augment’s notes, a marked term shows its definition when you hover or tap it, and each page ends with the terms it introduces.
23 terms from Computational thinking, each defined in a sentence or two, with the part of the syllabus where you first meet it.
Focusing on the features of a problem that are essential for a given purpose and removing unnecessary detail, to produce a simpler model or overview of the problem.
A precise, finite sequence of well-defined instructions that solves a problem or performs a task.
The process of developing a step-by-step series of instructions that solves a problem, and refining it until it is correct and efficient.
The thought processes involved in formulating a problem and expressing its solution so that a computer, whether a human or a machine, can carry it out effectively.
A small circle containing a label (a letter or number) that joins two parts of a flowchart without drawing a flowline between them; the flow continues from one connector to the other connector with the same label.
A restriction that a solution must work within, such as a limit on time, budget, hardware, software, law or the skills of its users.
The diamond-shaped flowchart symbol for a condition that is either true or false, with a separate labelled flowline leaving for each answer.
Breaking a complex problem or system into smaller, more manageable sub-problems that can each be understood, solved and tested separately.
A tree diagram that shows a problem at the top and, on each lower level, the sub-problems it is broken into.
A diagram that represents an algorithm using standard symbols for each kind of step, joined by arrows that show the order in which the steps are carried out.
An arrow in a flowchart that joins two symbols and shows which step is carried out next.
A description of the data a solution receives: what each item is, where it comes from, its data type, its format and its range of valid values.
The parallelogram-shaped flowchart symbol for data entering the algorithm (input) or results leaving it (output).
A specific outcome that a solution must achieve for the problem to count as solved.
A description of the information a solution produces: what each item is, its format and units, when it is produced and who receives it.
Identifying similarities or recurring elements within a problem, between problems, or in data, so that solutions can be reused, generalised or used to make predictions.
A structured description of a problem that sets out its scope, its limits and what a solution must achieve, so that goals can be agreed before design begins.
A short, precise description of the problem to be solved, saying who has the problem and what is wrong with the current situation.
The rectangular flowchart symbol for an operation that changes data, such as a calculation or an assignment of a value to a variable.
A measurable condition, written before the solution is built, that is used to judge whether the solution has met an objective.
The flowchart symbol, a rounded rectangle or oval, that marks where an algorithm starts or ends.
A table used when tracing an algorithm, with one column for each variable and one for output (often with extra columns for the conditions tested), in which every change of value is recorded in the order it happens.
Following an algorithm step by step by hand, with chosen input data, and recording the value of each variable and every output as the algorithm runs.