Computational Thinking DPF
16 patterns · 402 sections
Choose a heading to read that text in full, or open the complete publication.
Table of contents
In the published reading order. Pattern IDs are stable references, not sequence numbers.
- Table of Contents
Computational Thinking - Readme
Practical entries
- CP-DESCRIPTION-TO-BEHAVIOR - A notification rule becomes an ongoing service
- CP-INDEPENDENT-EXTENSIONS - A new data form and a new operation must work together
- CP-TRANSLATION-SCOPE - A translation works on test inputs; which executions does it preserve?
- CP-ANSWER-UNDER-LIMITS - Obtain the answer the work needs within available resources
- CP-RETRY-AND-RECOVER - Share calculations without merging requests or repeating their effects
Computational Thinking DPF Architectural Reference
CMP.Reference:1 - Problem frame and the algorithmic difficulty
- CMP.Reference:1.1 - A description specifies a family of possible processes
- CMP.Reference:1.2 - Mathematical, physical and algorithmic grounds cooperate
- CMP.Reference:1.3 - Build a whole, introduce a level, and generalize deliberately
- CMP.Reference:1.4 - Descriptions can be computed with, and ways can be obtained
- CMP.Reference:1.5 - A computation can be part of a larger computational practice
- CMP.Reference:1.6 - Use the grounds to choose and revise a method
- CMP.Reference:2 - Forces that shape the construction
- CMP.Reference:4 - Worked connection - One best selection becomes every best selection
- CMP.Reference:5 - Use checks, assumptions and recurring failures
- CMP.Reference:6 - Consequences and Architectural Rationale
- CMP.Reference:7 - Shared sources, alternatives and relations
- CMP.Reference:End
Part A - Construct an algorithm
- CMP.1 - Solve One Problem through Another or Transfer a Limit (Computational Reduction)
- CMP.2 - Derive a Recursive Procedure from a Problem Decomposition
- CMP.3 - Share and Schedule Repeated Subcomputations
- CMP.4 - Construct Computational Search with Justified Exclusions
- CMP.5 - Bound an Optimum or Recover a Feasible Candidate through a Relaxed Problem
- CMP.6 - Derive an Iterative Computational Update from Local Information
- CMP.7 - Construct a Learner from Examples and Feedback
Part C - Interpret, transform and compose computations
- CMP.12 - Construct an Interpreter or a Meaning-Preserving Translation
- CMP.13 - Construct a Computational Abstraction for the Property Being Asked
- CMP.14 - Compose Interacting Computations through Their Required Observations
- CMP.15 - Compose Independent Extensions of Data Variants and Operations
- CMP.16 - Construct Computational Units and Operations for a Required Whole