Computational Thinking
Subtopic 3
10.2 Computational Thinking and Algorithms
Test Point 3 Introduction to Algorithms
Algorithm is the description of the method of computational thinking to solve problems, which is the core and key of computer solution.
Basic Features
• Finiteness
• Algorithms must be able to perform wired steps and then stop
• Deterministic
• Each step of the algorithm must be clearly defined and should not create ambiguity in understanding
• Feasibility
• Each algorithm can be executed efficiently And can get a definite result
• Input item
• Has 0 or more inputs
• Output item
• Has 1 or more outputs
Algorithm control structure
• Sequence structures
• Choice structures
• Loop structures
Description of algorithms
• Natural language, flowcharts, pseudocode, NS diagrams and PAD diagrams
10.1 Computational thinking
Test point 1 Computational thinking and characteristics
concept
• Characterized by design and construction
• Represented by computer science
• Computational thinking is a series of thinking activities that use the basic concepts of computer science to solve problems, system design and human behavior, covering the breadth of computer science
feature
• Conceptualization is not procedural
• Basic
• human
• Mathematics and engineering thinking complement and integrate
• Thoughts not artifacts
• Computational thinking is for everyone, in all fields
The nature of computational thinking
• Abstraction and automation
The three scientific thinking corresponding to theoretical science, experimental science, and computational science are theoretical thinking, experimental thinking, and computational thinking
Test Point 2 Application of Computational Thinking
Computational Biology
Computational Chemistry
Computational Mathematics
Computational Physics