2.2.2 Computational methods - Filip
No description yet. This curated deck is ready for daily study.
Card preview (13)
define decomposition
breaking down a large problem into lots of small subproblem that can be solved independently
define abstraction
ignoring insignificant/ unnecessary details
define back tracking
methodically going down every possible path then going back on yourself once you find an error
define data mining
a technique used to find anomalies/ patterns in large sets of data Analysing/ converting large quantities of data into useful information
define hueristics
A general rule of thumb or estimated guess Used to reduce time taken to solve a problem Finds a solution close to the best solution or ‘good enough’
define pipelining
different tasks being undertaken at the same time to improve efficiency
define performance modelling
Performance modelling eliminates the need for true performance testing by providing mathematical methods to test a variety of loads on different operating systems.
Define divide and conquer
in this context divide and conquer refers to a way of decomposition involving divining then solving then merging parts of a larger problem back together
Name 4 computational methods
Problem recognition Problem decomposition Abstraction Backtracking Data mining Heuristics Performance modelling Pipelining Visualisation Divide and conquer
Benefits of data mining
Analysis of patterns Large quantity of data is turned into useful information
Drawbacks of data mining
Patterns can be spotted but but it cannot explain the reason behind them Privacy concerns - people may not want their data to be logged
Define problem recognition
Identifying that there is a problem to be solved, determine what that problem is and determine if it can be solved via computational methods
Advantages of heuristics
Good for large scale tasks