Front

Abstract data type

Back

A conceptual model of how data can be stored and the operations that can be carried out on the data.

Front

Abstraction by generalisation/categorisation

Back

The concept of reducing problems by putting similar aspects of a problem into hierarchical categories.

Front

Accepting state

Back

The state that identifies whether an input string has been accepted. Also known as the goal state.

Front

Address bus

Back

Used to specify a physical address in memory so that the data bus can access it.

Front

Addressable memory

Back

The concept that data and instructions are stored in memory using discrete addresses.

Front

Addressing mode

Back

The way in which the operand is interpreted.

Front

Adjacency list

Back

A data structure that stores a list of nodes with their adjacent nodes.

Front

Adjacency matrix

Back

A data structure set up as a two-dimensional array or grid that shows whether there is an edge between each pair of nodes.

Front

Algorithm

Back

A sequence of steps that can be followed to complete a task and that always terminates.

Front

Alphabet

Back

The acceptable symbols (characters, numbers) for a given Turing machine.