As we mention before,computational thinking into four core parts: decomposition, pattern recognition, abstraction, and algorithms.
The first part of computational thinking is decomposition. Decomposition is the ability to decompose a complex problem into multiple simple problems. Most complex problems can be solved by breaking them into multiple simple problems under a certain rule. For example, We can use the Scratch software to complete the development of the fruit ninja game. This requires the use of a large number of program blocks, and these program blocks are more complicated, but if we first decompose the problem into the vertical acceleration of a fruit in the air, the problem is further divided. It is broken down into the movement of the fruit in the vertical and horizontal directions, so the problem is much simpler. So we can see that from the simple movement of the fruit to the throwing of the fruit in the air to the design of the entire game, a complex problem is always there. It is composed of simple problems, and we have mastered the problem-phased ability to deal with the solution of complex problems.
The second part of computational thinking is pattern recognition. Pattern recognition is to understand the working mode and basic laws of a problem. By mastering the solution of a specific problem, we can identify and solve similar problems when we encounter similar problems. For example, we Learn to program to make an airplane move to the left, and then we can learn and solve the problem of making the airplane move to the right, up, down, or even change the speed of the airplane. This thinking is also very important in our daily learning.
The third part of computational thinking is abstraction. Abstraction is the ability to grasp the essence of the problem by ignoring irrelevant information, thereby establishing a general model. For example, there are three questions here: Question 1: n classmates, arranged in ascending heights. Question 2: n runners, ranked according to the time it took them to cross the finish line. Question 3: n fruits, find the three heaviest. These three questions are essentially the same. Whether it is sorting by size, sorting by performance, or finding the largest Value, as long as the sorting algorithm is mastered, these problems are all a same problem.
The fourth part of computational thinking is the algorithm. Algorithm design is to describe our ideas as logical steps and abilities, and it is also an exercise of logical thinking ability. We have ideas and ideas for the following problems, but how to express them clearly and accurately. It is necessary to exercise the ability of algorithm design. For example, if the keyboard design character movement is realized in the program design, we can first express it in the process, and then we can express it in the form of code according to the flowchart to let the computer execute it.If we want to design an automatic counter teller machine, first we need to design the algorithm to realize this function. We can design such a flow chart. First, the customer needs to insert the bank card, and then judge, if the card number is correct, the card number information can be read. Then judge step by step, and finally realize the automatic withdrawal function.