Computational Thinking DPF
15 patterns · 366 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-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: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