Computational thinking & problem-solving: Difference between revisions
Mr. MacKenty (talk | contribs) |
Mr. MacKenty (talk | contribs) |
||
| (8 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
<center> | <!-- <center> | ||
<blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;"> | <blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;"> | ||
[[File:Exclamation.png]] This is one of '''the most important ideas''' you can remember: | [[File:Exclamation.png]] This is one of '''the most important ideas''' you can remember: | ||
| Line 6: | Line 6: | ||
</blockquote> | </blockquote> | ||
</center> | </center> | ||
--> | |||
[[file:computation.png|right|frame|Computational thinking, problem-solving and programming<ref>http://www.flaticon.com/</ref>]] | [[file:computation.png|right|frame|Computational thinking, problem-solving and programming<ref>http://www.flaticon.com/</ref>]] | ||
| Line 20: | Line 20: | ||
=== Thinking procedurally === | === Thinking procedurally === | ||
* [[Procedural thinking]] | * [[Procedural thinking]] | ||
* [[Evaluating process]] | * [[Evaluating process]] | ||
* [[Sub-process]] | * [[Sub-process]] | ||
=== Decisions === | |||
* [[Decisions]] | |||
=== Thinking logically === | === Thinking logically === | ||
* [[Logical rules]] | * [[Logical rules]] | ||
| Line 34: | Line 36: | ||
* [[Inputs and outputs]] | * [[Inputs and outputs]] | ||
* [[Pre-conditions]] | * [[Pre-conditions]] | ||
* [[Exceptions and pre-conditions]] | * [[Exceptions and pre-conditions | Exceptions]] | ||
=== Thinking concurrently === | === Thinking concurrently === | ||
| Line 43: | Line 45: | ||
* [[Abstraction]] | * [[Abstraction]] | ||
=== Connecting computational thinking and program design === | === Connecting computational thinking and program design === | ||
| Line 51: | Line 52: | ||
* [[Algorithms]] | * [[Algorithms]] | ||
* [[Applied algorithmic thinking]] | * [[Applied algorithmic thinking]] | ||
=== Use of programming languages === | === Use of programming languages === | ||
| Line 73: | Line 65: | ||
* [[Functions]] | * [[Functions]] | ||
* [[Loops]] | * [[Loops]] | ||
== Standards == | == Standards == | ||
Latest revision as of 11:37, 21 May 2024
Computational thinking, problem-solving and programming[1]
Wing (2006, 2011) defined computational thinking as the thought processes involved in formulating problems and their solutions so that the solutions are represented in a form that can be effectively carried out by a computer. [2]
Computational Thinking (CT) is a process that generalizes a solution to open-ended problems. Open-ended problems encourage full, meaningful answers based on multiple variables, which require using decomposition, data representation, generalization, modeling, and algorithms found in Computational Thinking. Computational Thinking requires the decomposition of the entire decision making process, the variables involved, and all possible solutions, ensuring that the right decision is made based on the corresponding parameters and limitations of the problem. The term computational thinking was first used by Seymour Papert in 1980 and again in 1996. Computational thinking can be used to algorithmically solve complicated problems of scale, and is often used to realize large improvements in efficiency[3]
The big ideas in computational thinking[edit]
Thinking procedurally[edit]
Decisions[edit]
Thinking logically[edit]
Thinking ahead[edit]
Thinking concurrently[edit]
Thinking abstractly[edit]
Connecting computational thinking and program design[edit]
Use of programming languages[edit]
Standards[edit]
These standards are used from the IB Computer Science Subject Guide[4]
| Computational thinking, problem-solving and programming | |
| Identify the procedure appropriate to solving a problem. | Computational Thinking |
| Evaluate whether the order in which activities are undertaken will result in the required outcome. | Computational Thinking |
| Explain the role of sub-procedures in solving a problem. | Computational Thinking |
| Identify when decision-making is required in a specified situation. | Computational Thinking |
| Identify the decisions required for the solution to a specified problem. | Computational Thinking |
| Identify the condition associated with a given decision in a specified problem. | Computational Thinking |
| Explain the relationship between the decisions and conditions of a system. | Computational Thinking |
| Deduce logical rules for real-world situations. | Computational Thinking |
| Identify the inputs and outputs required in a solution. | Computational Thinking |
| Identify pre-planning in a suggested problem and solution. | Computational Thinking |
| Explain the need for pre-conditions when executing an algorithm. | Computational Thinking |
| Outline the pre- and post-conditions to a specified problem. | Computational Thinking |
| Identify exceptions that need to be considered in a specified problem solution. | Computational Thinking |
| Identify the parts of a solution that could be implemented concurrently. | Computational Thinking |
| Describe how concurrent processing can be used to solve a problem. | Computational Thinking |
| Evaluate the decision to use concurrent processing in solving a problem. | Computational Thinking |
| Identify examples of abstraction. | Computational Thinking |
| Explain why abstraction is required in the derivation of computational solutions for a specified situation. | Computational Thinking |
| Construct an abstraction from a specified situation. | Computational Thinking |
| Distinguish between a real-world entity and its abstraction. | Computational Thinking |
| Describe the characteristics of standard algorithms on linear arrays. | Computational Thinking |
| Outline the standard operations of collections. | Computational Thinking |
| Discuss an algorithm to solve a specific problem. | Computational Thinking |
| Analyse an algorithm presented as a flow chart. | Computational Thinking |
| Analyse an algorithm presented as pseudocode. | Computational Thinking |
| Construct pseudocode to represent an algorithm. | Computational Thinking |
| Suggest suitable algorithms to solve a specific problem. | Computational Thinking |
| Deduce the efficiency of an algorithm in the context of its use. | Computational Thinking |
| Determine the number of times a step in an algorithm will be performed for given input data. | Computational Thinking |
| State the fundamental operations of a computer. | Computational Thinking |
| Distinguish between fundamental and compound operations of a computer. | Computational Thinking |
| Explain the essential features of a computer language. | Computational Thinking |
| Explain the need for higher level languages. | Computational Thinking |
| Outline the need for a translation process from a higher level language to machine executable code. | Computational Thinking |
| Define the terms: variable, constant, operator, object. | Computational Thinking |
| Define common operators. | Computational Thinking |
| Analyse the use of variables, constants and operators in algorithms. | Computational Thinking |
| Construct algorithms using loops, branching. | Computational Thinking |
| Describe the characteristics and applications of a collection. | Computational Thinking |
| Construct algorithms using the access methods of a collection. | Computational Thinking |
| Discuss the need for sub-programmes and collections within programmed solutions. | Computational Thinking |
| Construct algorithms using pre- defined sub-programmes, one- dimensional arrays and/or collections. | Computational Thinking |
References[edit]
- ↑ http://www.flaticon.com/
- ↑ http://pact.sri.com/downloads/Assessment-Design-Patterns-for-Computational%20Thinking-Practices-Secondary-Computer-Science.pdf
- ↑ https://en.wikipedia.org/wiki/Computational_thinking
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.