TECH TIP: Computational Thinking
TECH TIP: Computational Thinking
Source: The Bowers Institute at The Tech (thetech.org/bowersinstitute), 4-page educator handout
Format: Visual reference card with tables, facilitative tips, and cross-subject examples
Scope: Focused 4-element framework; strongest on classroom application and cross-subject mapping
The 4-Element Framework
This source focuses on the canonical four elements that form the universal core of CT — the same four that appear in every other CT curriculum:
Computational thinking at its core is a problem-solving process that can be used by everyone, in a variety of content areas and everyday contexts.
Decomposition — Breaking down problems into smaller sections. The solutions to the smaller problems are then combined to solve the original, larger problem. Enables other CT elements to apply more effectively to complex challenges.
Pattern Recognition — Examining the problem for patterns, or similarities to previously solved problems. Can lead to grouping, organizing, or streamlining for more efficient outcomes. A lack of patterns is also useful information: it means no further simplification is available.
Abstraction — Taking a step back to create a more generic solution. Requires analyzing the problem to remove extra detail and highlight the basic parts. Public transit maps are the canonical example: only stops and direction are shown.
Algorithms — Step-by-step instructions to solve a problem. Can be written in plain language, flowcharts, or pseudocode. Recipes, furniture assembly instructions, sports plays, and navigation directions are all algorithms.
Facilitative Questions
Useful questions for guiding students through each CT element:
| Element | Questions |
|---|---|
| Decomposition | What are the different parts of this problem? How could it be divided into smaller parts? Describe the main sections. |
| Pattern Recognition | Are there any patterns? Do you notice similarities to something you've already solved? Do any parts share qualities? Does anything repeat? |
| Abstraction | What are you trying to solve? Which details are important? What can you leave out? Can you describe this as something more basic? |
| Algorithms | What's the first step? What are all the steps needed? In what order should they be completed? |
These are the questions to ask before, during, and after any CT-based activity — plugged or unplugged.
Facilitative Tips for Educators
- Integrate CT into other subjects. Find where your classroom already practices CT and name it explicitly. Don't introduce CT as a separate subject if it can be surfaced in math, science, ELA, or social studies work already happening.
- Focus on one element at a time. Finding opportunities to practice each individual element is easier than designing activities that combine all four at once.
- Use long-term projects to exercise all four elements together. The natural order in complex projects: decompose the task → recognize prior knowledge that applies → sift for relevant details (abstraction) → create a plan (algorithm).
- Combine plugged and unplugged activities. Varied approaches reinforce confidence with CT skills before writing a formal computer program.
Cross-Subject Examples Matrix
The most useful part of this source: concrete evidence that CT is already happening in every subject.
| Decomposition | Pattern Recognition | Algorithms | Abstraction | |
|---|---|---|---|---|
| Math | Factoring large numbers (4-5); Tangrams — break a shape into geometric parts (K-5) | Sequencing problems (1-3); Symmetry in geometry (1-5); Two-variable strategies in three-variable equations (6-8) | PEMDAS, FOIL — correct order of operations (6-8); Arithmetic processes and formulas (K-5) | Solving word problems by filtering what's necessary (3-5); Data analysis: teasing trends from large sample sets (9-12) |
| Science | Logical inference: break a large scientific question into tractable sub-experiments (K-12) | Sorting/classification in biology and astronomy (6-12); Neurons doing pattern recognition to process data (9-12) | Lab "methods" or "procedure" = a set of instructions (6-12) | Scientific and mathematical models distill complex systems (K-12); Scientific laws = abstraction of wide experiment sets (K-12) |
| ELA | Breaking an essay into central argument, introduction, and conclusion written separately (3-12) | Phonics: letter patterns → correct pronunciation of new words (K-12) | Traditional poetic forms defined like algorithms: meter, rhyme structure, line order (1-12) | Book reports: abstract themes and thesis; omit plot detail (4-8) |
| Social Studies | Causal inference: break historical events into societal and cultural factors (9-12); Three branches of government (4-12) | Empires follow similar trajectories across history (6-10) | Legislative process as a conditional algorithm: drafting → debate → vote → presidential approval; veto triggers supermajority requirement (3-12) | Thematic analysis of history over minute detail (6-12); Maps as abstraction: different maps for different level of detail needed (3-8) |
Cross-links
- computational-thinking — main synthesized concept page
- problem-framing — CT decomposition as one framing move; problem-framing asks whether you're solving the right problem
- design-thinking — parallel human-centered problem-solving framework
- inductive-reasoning — pattern recognition is inductive in nature
- deductive-reasoning — algorithmic thinking typically applies deductive structure
- apple-developer-academy-prep-learning-and-thinking — CT as core reasoning skill in ADA prep