Abstraction - Automation

From TRCCompSci - AQA Computer Science
Revision as of 13:14, 26 January 2017 by Admin (talk | contribs) (Problem Abstraction)
Jump to: navigation, search

Information Hiding

Information Hiding is the process of hiding the complexity of a system behind the interface for that system. For example a car has an accelerator to control the speed of the car, however you car is deciding how much fuel to inject, what the ratio of fuel to air, when to time the sparks etc.

Abstraction

Removing details that are not essential for a problem to be solved. This can be interpreted as removing indirectly relevant data repeatedly until a complex problem (function) becomes a series of simpler problems (functions) which can easily accomplish the same larger problem (function) in a more efficient & simpler way. This process of breaking down a large problem into several smaller ones is also known as procedural decomposition.

Data Abstraction

Functional Abstraction

Procedural Abstraction

Problem Abstraction

Removing details from a problem until it is represented in a way that is possible to solve.

Decomposition

Solving a problem by breaking the problem down into small mini problems.

For example, making a cup of tea can be broken down into tasks such as fill kettle, boil kettle, wash cup, add tea bag, remove tea bag, add milk, stir etc.

Composition

Solving a problem by taking several small problems and grouping them together to specify a bigger problem (Opposite of decomposition).

Automation

Automation is the process of building models of real world objects to solve a problem. Models can be made by including only details that are relevant to the problem and discarding those that are irrelevant or have only minor effects. Using the model, an algorithm can then be designed to solve and automate the problem.