The computational thinking process consists of the following steps:
STEP 1 – Decomposition of the problem: Breaking the problem down into smaller, more manageable pieces of information or tasks. This makes the process more achievable, and allows the task to be tackled by a team working together, each student bringing their own experience and skills to it.
STEP 2 – Pattern recognition: Once we have decomposed the initial problem into different parts, it is possible that we find similarities or common trends in these problems – in other words, logical organisational patterns in the data. IIt is often better to solve whole classes of problems rather than just the one we have at the time: in maths, for instance, it’s much more useful to be able to do long multiplication than simply know the answer to 31 x 27.
STEP 3 – Abstraction: This is the process of simplifying things, that is, identifying what is important and separating it from the smaller details. This allows us to get solutions for different problems at the same time. Put differently, it means looking for general models that represent the patterns we recognised, removing details that are not relevant for our process. Abstraction allows us to manage this complexity by putting the detail inside a box.
STEP 4 – Algorithm design: Trying and implementing step-by-step solutions, failing, and trying again, until we find solutions that might work for this and similar problems. Often there is more than one way to solve a problem, but some ways can be quicker than others, so remember: the fewer steps to follow and the more accurate the instructions, the better and more efficient our algorithm will be.