2.2.2 - Computational Methods Flashcards
What is backtracking?
An algorithm that incrementally finds a solution by methodically trying different sequences and abandoning a path when it knows it cannot lead to a valid solution.
What is a computable problem?
A problem for which every instance can be solved in a finite number of steps by means of algorithm.
What are computational methods?
A method of solving a problem which by some form of computation in devising and implementing an algorithm.
What is data mining?
An algorithm that finds a solution by analysing large data sets to uncover trends and relationships between variables.
What is divide and conquer?
An algorithm design technique to decompose and solve problems by reducing the problem size with each iteration until the sub problem becomes solvable.
What is heuristics?
A ‘rule of thumb’ algorithm which can produce a valid, but sub-optimal solution for a hard problem as an approximation.
What is performance modelling?
The process of simulating the behaviour of a model under different virtual user and system loads by mathematical approximation.
What is pipelining?
The process of splitting a task into parts and then searching for sub tasks that can be processed simultaneously to overlap the processing of each part.
What is problem decomposition?
The process of splitting a given problem into smaller, solvable sub-problems that are easier to conceive, understand, maintain and program.
What is problem recognition?
The ability to recognise the most effective strategy to solve a problem.
What is visualisation?
The use of a visual representation of an algorithm or data structure to translate a problem and its solution to a more human readable form.
