Assume you are looking for the shortest route from point A to point B in a multi-story building. These two points are located on different stories. How will you proceed?
Based on this example from everyday life, match the individual steps of Computational Thinking to each of your thoughts:
Understand the problem
Abstract the problem
Decompose the problem
Develop a (an algorithmic) solution
Test and transfer
Can I apply the processes I have used in previous situations in order to find the shortest route?
I identify the individual sections of the route, for example: hallway + story + hallway + hallway
Either I walk down the hallway or I first walk to the stairs to go immediately to the correct story. Which solution leads to the shortest route?
What does the “shortest route” mean? In distance or in time? Which version do I want?
I would like to find the shortest route in distance. To do so, I must consider the essential aspects: How much distance does changing stories entail? How far do I walk in a hallway?