7 of the Computer Science glossary’s terms, each with the part of the syllabus where you first meet it.
A complexity in which the number of steps grows in proportion to the square of the input size, so that doubling the input multiplies the work by four.
Reducing the precision of values by rounding them to a smaller set of levels, so that many small values become zero.
Computing that uses quantum-mechanical effects such as superposition and entanglement, with quantum bits (qubits) as the basic unit of information, to solve certain problems far faster than classical computers can.
A request to a database for data that meets stated conditions, written in SQL as a SELECT statement.
The opening text of an examination question that sets out the scenario, and sometimes data, a table or a diagram, which every part of the question then refers to.
A data structure in which items are added at one end, the rear, and removed from the other end, the front, so items leave in the order they arrived.
A divide-and-conquer sorting algorithm that chooses a pivot element, partitions the list so that smaller elements come before the pivot and the others after it, and then sorts the two parts recursively.