It is a way to understand a problem and then logically work out a good solution.
Decomposition – breaking down a larger problem into several smaller simpler tasks
defining the problem in more detail and making it easier to solve
top-down tree diagrams – each sub-problem is split into smaller sub elements
A pattern is where there is some repetitive parts to the overall problem. This means more than one
part of a problem can be dealt with by simply altering the information going into the pattern.
loops, subroutines, code libraries and creating classes are examples of patterns
Abstraction is to examine a problem and identify its most essential details and to
disregard any non-essential details.
Algorithm - is a list of step-by-step instructions that, when followed, will solve a problem.
Being able to lay out an algorithm when writing a computer program is vital. This is because a
computer needs to be told what to do step by step.
Two methods to set out an algorithm:
Pseudocode – text statements written for each step of the algorithm
Flow chart – this uses a set of standard shapes and arrows to make a diagram of the algorithm
Working out the algorithm for solving a problem requires thinking in a clear and
logical way
Pattern recognition - being aware of any repetition in solving
the task, this pattern can simplify the steps needed to solve the
problem and furthermore, if the pattern can be made general, it
can be used to solve other problems as well.
Abstraction - recognising the most essential elements of a
problem and disregard irrelevant details.
Algorithm - working out the steps needed to solve the problem.
An algorithm can be set out as pseudocode or shown graphically
in a flow diagram
START and End statements
DISPLAY, INPUT, COMBINE, CALCULATE
END IF
Iteration – do until
Iteration – FOR
Casting – add float as a data type
String handling - + symbol used to denote concatenation
A flowchart is a diagram that shows the breakdown of a task or system into all the necessary steps.
Terminator (start/end program) – rounded rectangle
Decomposition – breaking down a larger problem into several smaller simpler tasks
defining the problem in more detail and making it easier to solve
top-down tree diagrams – each sub-problem is split into smaller sub elements
A pattern is where there is some repetitive parts to the overall problem. This means more than one
part of a problem can be dealt with by simply altering the information going into the pattern.
loops, subroutines, code libraries and creating classes are examples of patterns
Abstraction is to examine a problem and identify its most essential details and to
disregard any non-essential details.
Algorithm - is a list of step-by-step instructions that, when followed, will solve a problem.
Being able to lay out an algorithm when writing a computer program is vital. This is because a
computer needs to be told what to do step by step.
Two methods to set out an algorithm:
Pseudocode – text statements written for each step of the algorithm
Flow chart – this uses a set of standard shapes and arrows to make a diagram of the algorithm
Working out the algorithm for solving a problem requires thinking in a clear and
logical way
Pattern recognition - being aware of any repetition in solving
the task, this pattern can simplify the steps needed to solve the
problem and furthermore, if the pattern can be made general, it
can be used to solve other problems as well.
Abstraction - recognising the most essential elements of a
problem and disregard irrelevant details.
Algorithm - working out the steps needed to solve the problem.
An algorithm can be set out as pseudocode or shown graphically
in a flow diagram
START and End statements
DISPLAY, INPUT, COMBINE, CALCULATE
END IF
Iteration – do until
Iteration – FOR
Casting – add float as a data type
String handling - + symbol used to denote concatenation
A flowchart is a diagram that shows the breakdown of a task or system into all the necessary steps.
Terminator (start/end program) – rounded rectangle
