Level 41 Level 43
Level 42

2.2.2 - Computational Methods


21 words 0 ignored

Ready to learn       Ready to review

Ignore words

Check the boxes below to ignore/unignore words, then click save at the bottom. Ignored words will never appear in any learning session.

All None

Ignore?
computable
when there is an algorithm that can solve every instance of a problem in a finite number of steps, the problem is ...
enumeration
a method of problem solving where all possible solutions are tried until the correct one is found (exhaustive search)
size of the problem
enumeration can be inefficient, as the number of possible solutions often increases exponentially as the ... increases
simulation
a method of problem solving where a model of a real system is designed in order to understand the behaviour of the system and evaluate strategies for operating the system
climate change predictions
problems suited to simulation include financial risk analysis, population predictions, queuing problems, engineering design problems and ...
divide and conquer
a powerful technique used in problem solving which reduces the size of the problem with every iteration, such as a binary search
problem abstraction
simulation and problem solving will often require ... to reduce the problem to its essentials, making it easier to solve, or reducing it to a problem that has already been solved
automation
a method of problem solving where action models are built and put into action to solve problems
visualisation
the representation of an object, data, or a problem/situation as a graphic, so it is easy to understand
backtracking
a methodical way of trying out different sequences until one is found that leads to a solution
set of choices
backtracking can be used for mazes, depth-first graph traversal, or for problems where each decision leads to a new ...
data mining
the process of digging through big data sets to discover hidden connections and patterns, and to predict future trends, often by using software packages like analytics tools
big data
large sets of data that cannot easily be handled in a traditional database
intractable problem
a problem where an algorithm for the solution may exist but it would take an unreasonably long time to find the solution
Travelling Salesman Problem
an example of an intractable problem
brute-force
the method of testing out every combination of possibilities
heuristic approach
an approach to problem solving where an algorithm or methodology is used that is not guaranteed to be optimal or perfect, but provides a sufficient solution for the purpose
speed
an adequate solution found from a heuristic approach may be found by trading optimality, completeness, accuracy or precision for ...
performance modelling
the process of simulating different user and system loads on a computer using mathematical approximation instead of actual performance testing, which can be difficult and expensive
new conditions
performance modelling could be used for testing the performance of a network with ...
organisation's requirements
the output of performance modelling could then be used to help plan a new system to suit the ...