Theory of computation

Sequence is the name given to instructions that follow on from one another

● Iteration is the process of repeating an operation ● Iteration structures include FOR and WHILE loops

Selection is the process of choosing an action to take based on the result of a comparison of values Different actions can be taken depending on the result of a comparison The statements IF, ELSE IF, ELSE and END IF can all be used

Assignment is the process of giving a value to a variable or constant

A representation of a problem arrived at by removing unnecessary details from the problem.

A grouping by common characteristics to arrive at a hierarchical relationship of the “is a kind of” type

Defined as the process of hiding all details of an object that do not contribute to its essential characteristics . Used in problem solving to simplify a problem without changing the essence of the issue

Involves breaking down a complex model into a series of reusable procedures

Abstracting a procedure further disregards the particular method of a procedure and results in just a function

This allows new kinds of data structures to be created from previously defined data structures

Details are removed from a problem until it is represented in a way that is solvable

A problem is divided into a series of smaller sub-problems These smaller problems can be solved individually or further divided until all parts of the original problem have been solved

Can be used to combine procedures to form a larger system

The process of putting abstractions of real world phenomena into action to solve problems

the process of omitting unnecessary details from a problem

problems that have a polynomial (or less) time solution

problems that have no polynomial (or less) time solution

is the unsolvable problem of determining whether any program will eventually stop if given particular input.