Algorithm – a finite sequence of clearly defined steps necessary to perform a certain type of task, a course of action leading to the solution of a problem.

Attribute – used to specify a particular property of a selected element.

FIFO – First In First Out. Another term for a queue.

Cartesian product – the name Cartesian product refers to the concept of a Cartesian coordinate system on the plane because of the following analogy: points in a Cartesian coordinate system on the plane are described by ordered pairs of numbers (the first number is called the abscissa, the second the ordinate) – the elements of the Cartesian product can therefore be equated with points on the plane. However, in general, elements of sets are not necessarily numbers, they can be any objects.

LIFO – Last In First Out. Another term for a stack.

Selector – is an element used to explicitly specify to which element the properties will be applied (select = choice).

Constructor – a method called when an object is created.

Reference – a value that contains information about the location of another value in memory or data carrier.

Optimal solution – the most advantageous solution from a certain point of view, e.g. if you care about time – the optimal solution will be performing the operation as quickly as possible, regardless of the cost of e.g. memory.

Data structure – a way of storing data in the computer memory.

Pointer – a variable that holds the memory address to some object.

Variable – a programming construct that has three basic attributes: symbolic name, storage location and value.