**A Level Computer Science: Computational Methods**

This module contains:

##### Compatible with the following examination boards

### Download A Level Module 51: Computational methods

**This download is exclusively for Teach Computer Science subscribers!**

To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!

Already a member? Log in to download.

**Computational Methods**

A problem is said to be computable if there is an algorithm that can solve every instance of it in a finite number of steps. Understanding the problem is the first step to problem-solving. To understand the problem, we need all data to understand the problem.

It is also important to check whether the problem is solvable. If it is solvable, a complex problem can be broken down into simpler modules, that can be further solved individually.

This A Level Computer Science module introduces computational methods to your students, explaining:

- Problem-solving strategies such as divide and conquer, top-down approach & problem abstraction
- Techniques for problem-solving such as back-tracking, data mining, heuristics, pipelining and many more.

**More Problem solving and programming Modules**

Computational Methods is one lesson in our Problem solving and programming module. The other theory lessons can be found below: