Revise Computingrevisecomputing.co.uk
Free student revisionSee questionsFor schoolsSchool enquiry
Free revisionSee questionsFor schoolsSchool enquiry
Knowledge/A Level/H446/02 Algorithms and programming/Computational Methods/Features that make a problem solvable…

Features that make a problem solvable by computational methods

Features that make a problem solvable by computational methods.

2.2.2 Computational Methods

Computational Methods — Note 1 of 6

Candidates need to be able to determine if a problem can be solved using computational methods, such as decomposition, abstraction, calculations and storage of data.

What you need to know

Not every problem can be solved by a computer. A problem is suitable for computational methods if it can be clearly defined, broken down and solved using calculations and stored data within a reasonable time.

What to know

  • The problem can be clearly defined, with known inputs and expected outputs.
  • The problem can be decomposed into smaller steps that can be expressed as an algorithm.
  • Abstraction can be applied to produce a model the computer can work with.
  • The problem involves calculations, data processing or the storage and retrieval of data.
  • A solution can be found within a reasonable time with the resources available. Some problems are solvable in theory but would take too long (intractable), so heuristics may be used instead.

Exam technique

  • Tip:In the programming project and exam, justify which features of a specific problem make it solvable computationally.

Computational Methods

Note 1 of 6

  1. 1Features that make a problem solvable by computational methods
  2. 2Problem recognition
  3. 3Problem decomposition
  4. 4Use of divide and conquer
  5. 5Use of abstraction
  6. 6Backtracking, data mining, heuristics, performance modelling, pipelining and visualisation
Topic overview
← Previous topicUse of object oriented techniques2.2.1 Programming TechniquesNext note →Problem recognition2.2.2 Computational Methods

Back to Computational Methods