Decomposition in
Computational Thinking
This teacher training module prepares educators to confidently teach the Decomposition sub-skill under Computational Thinking for Class 6, as defined in the CBSE CT & AI Curriculum 2026–27. Decomposition is the ability to break a complex problem into smaller, manageable, and interdependent sub-problems — a foundational skill for structured thinking, algorithm design, and data analysis.
At Class 6 level, decomposition moves significantly beyond simple step-listing into working with interdependent clues, constraints, and conditions across numerical, geometric, transactional, tabular, and visual contexts.
- Understand what Decomposition means across six distinct problem contexts at Class 6 level.
- Map all 6 LO sub-areas to worked classroom examples and their decomposition structure.
- Practise 5 hands-on activities that teach decomposition as a systematic process, not just an intuitive one.
- Apply a rubric to assess the quality of a student’s decomposition, not just their final answer.
- Identify and address the most common student errors when tackling interdependent constraints.
| Module Component | Duration | Format |
|---|---|---|
| Section 1: Overview & Curriculum Context | 20 min | Presentation + Discussion |
| Section 2: Unpacking the Learning Outcomes | 30 min | Worked Examples + Group Analysis |
| Section 3: Pedagogical Strategies | 25 min | Demonstration |
| Section 4: Classroom Activities (Hands-on) | 65 min | Workshop |
| Section 5: Assessment Strategies | 25 min | Rubric Practice |
| Section 6: Common Misconceptions & FAQs | 15 min | Q&A |
Class 6 students are expected to break down problems that involve interdependent clues and constraints — meaning solving one part often depends on information from another part. The six sub-areas below define the scope of this LO, each with a classroom-level worked example showing what decomposition looks like in practice.
In earlier classes, decomposition meant listing steps. At Class 6, sub-problems are linked — solving sub-problem B requires the answer from sub-problem A first. Students must identify these dependencies and decide on the order in which to tackle sub-problems. This is the key cognitive leap at this level.
| # | LO Area | What it looks like in Class 6 | Bloom’s Level |
|---|---|---|---|
| LO 1 | Numerical clues — place value, operations, factors, multiples, comparisons | A mystery number problem with 4 clues (it’s a 2-digit number; it’s a multiple of 7; its digits sum to 11; it’s greater than 65) — students decompose, apply each clue, and use elimination | Analyse / Evaluate |
| LO 2 | Properties of 2D and 3D shapes (faces, edges, vertices, diagonals, angles) | A mystery shape puzzle: “I have 6 faces, 12 edges, and 8 vertices. Two of my faces are regular hexagons. What am I?” — students decompose the properties to identify and verify the shape | Analyse |
| LO 3 | Multi-step transfers / exchanges (money, quantities, digits, objects) with conditions | A coin/quantity exchange problem with 3–4 conditional steps (e.g., “Arjun has ₹50. He gives Meera a third of his amount. Meera then spends ₹8 and doubles what she has left. What does each person have now?”) — students must track each sub-transfer and its effect | Apply / Analyse |
| LO 4 | Tables, grids, or charts requiring cross-referencing of multiple data points | A logic grid/table where students must use given constraints to fill in a 4×4 who-has-what matrix, crossing off impossible cells row by row and column by column | Analyse / Evaluate |
| LO 5 | Conditional rules for counting, grouping, sorting, or eliminating possibilities | A problem with conditions: “Arrange 4 children in a row: A must be before B, C cannot be first, D must be last.” Students decompose the constraint list, apply fixed constraints first, then variable ones | Evaluate / Create |
| LO 6 | Visual representations that encode numerical or logical values | A balance-scale puzzle with 3 scales, each showing different combinations of shapes. Students decompose across scales to find the weight of each individual shape | Analyse / Evaluate |
Classroom Example Bank — Decomposition in Action:
▲ The 5-step Decomposition Process — use this visual with students and teachers throughout the module.
Decomposition must be taught as a conscious, structured process — not as intuition. The strategies below help teachers make the invisible thinking process of decomposition visible and transferable.
| Strategy | Description | Best for LO |
|---|---|---|
| Clue Sorting Before Solving | Before any calculation, students physically sort all clues into categories: Fixed values, Relational clues, Conditional clues, and Elimination clues. Solving only begins after all clues are sorted. | LO 1, LO 2, LO 5 |
| Dependency Mapping | Students draw a simple arrow diagram showing which sub-problem must be solved before another. Makes the inter-dependencies explicit and prevents students from “jumping” to attractive sub-problems out of order. | LO 3, LO 6 |
| Most-Restrictive-First (MRF) | Teach students to always tackle the most restrictive constraint first (the one that eliminates the most possibilities). This is a direct analogy to efficient algorithm design. | LO 1, LO 4, LO 5 |
| State Tracking Table | For multi-step transfer/exchange problems, students maintain a running table showing each person’s/object’s state after each step. Prevents the most common error of losing track mid-problem. | LO 3 |
| Anchor and Build | For visual/scale problems and logic grids, students identify the one “anchor” (the known or fixed value) and build outward from it. Prevents the common error of trying to solve everything simultaneously. | LO 4, LO 6 |
| Verify-All (Not Just the Answer) | Students must check their final answer against every original clue/constraint — not just the last step. Builds the habit of whole-problem verification, critical in algorithm debugging. | All LOs |
The most powerful trainer demonstration is to present a multi-step transfer problem (LO 3) and solve it without a state tracking table first — making visible errors as state is “lost.” Then solve the same problem using the table. The contrast is dramatic and immediately motivates the strategy. Plan 10 minutes for this demonstration.
Each activity teaches decomposition as a process. Students are required to document their decomposition steps, not just their answer — the process is the primary learning object.
Students receive a set of 4–5 clue cards for a mystery number. The challenge has two phases: (a) solve the mystery using the clues, and (b) rank the clues from “most useful first” and explain their ranking. The ranking task forces reflection on efficiency of decomposition — a key CT habit.
- Printed clue card sets (3 difficulty levels: 3-clue, 4-clue, 5-clue)
- Clue Sorting Template (Fixed / Relational / Conditional / Elimination)
- Number grid (1–100) for visual elimination
- Require students to use the number grid — cross off eliminated numbers as each clue is applied.
- Ask: “Which clue eliminated the most numbers? Why should that go first?”
- Extension: Give students only 3 of the 5 clues. Can they still find a unique answer? What does ambiguity mean?
Each group receives a “Shape Dossier” — a set of property clue cards describing an unknown 2D or 3D shape. Students must decompose the properties systematically, using a Shape Elimination Matrix (a grid of all possible shapes vs all given properties) to cross-check each property until only one shape remains. They then justify their answer by verifying all properties.
- Shape Dossier card sets (2D set and 3D set, 2 difficulty levels each)
- Shape Elimination Matrix (printed grid)
- 3D shape models or printed nets (for verification)
- Explicitly introduce Euler’s formula (V − E + F = 2) as a verification tool for 3D shapes.
- Ask: “Which property — faces, edges, or vertices — narrows the list the most in this problem?”
- Emphasise that decomposing properties one at a time is more reliable than trying to guess the shape from a “general impression.”
Students solve a 4–5 step conditional exchange problem (money, objects, or quantities) using a mandatory State Tracking Table. Each row of the table represents one transfer step, showing the state of all parties before and after. Students cannot write a final answer without completing the full table. A second problem is then solved without the table — students experience first-hand why the table is essential.
- Printed problem card (money exchange, quantity transfer, or digit swap)
- State Tracking Table template (columns: Step / Condition / Person A / Person B / Person C)
- Play money or tokens (optional, for physical enactment)
- The “without the table” second problem is deliberate — let students make errors. Debrief: “What went wrong? What information did you lose track of?”
- Ask: “What real-life system uses a state tracking table?” (Bank statements, inventory logs, hospital charts.)
- Connect to computing: “A computer’s memory works exactly like this — every variable has a state that changes with each instruction.”
Groups receive a classic logic grid puzzle (e.g., 4 people × 4 attributes — which person has which pet, hobby, house colour, and drink?). The puzzle is solved entirely through systematic decomposition: each clue is applied to the grid one at a time, marking ✓ (confirmed) or ✗ (eliminated), until all cells are determined. Students must document which clue they used at each step and why.
- Printed 4×4 Logic Grid puzzle (2 difficulty levels)
- Clue Application Log template (for recording sequence of clue use)
- Pencils (for ✓/✗ marking — NOT pen)
- Model the first two clues as a whole class before releasing to groups.
- Enforce the Clue Application Log — groups must note which clue was used at each step.
- Ask: “Was there a point where you got stuck? Which clue unlocked the next step?”
- Connect: “Logic grids are a simplified model of how databases answer ‘JOIN’ queries — cross-referencing multiple tables.”
Students receive a set of 3 interconnected balance scale images, where each scale shows a different combination of shape-weights. No scale alone can be solved; students must identify the anchor scale (the one with the most information) and decompose across all three scales using substitution. A second harder version uses 4 scales with one scale acting as a red herring (consistent with but not necessary for the solution).
- Printed balance scale puzzle cards (2 levels)
- Decomposition Diagram template (for mapping scale dependencies)
- Optional: physical pan balance + weights for kinesthetic verification
- Teach Anchor-and-Build explicitly: “Find the scale that gives you the most certain information first.”
- Ask: “Which scale is the anchor? How did you decide?”
- The red-herring scale in the harder version teaches a valuable lesson: not every piece of information is necessary. Recognising redundancy is a key skill in both problem-solving and programming.
- Connect to algebra: “Each shape is a variable. This is a system of equations — solved by substitution.”
Decomposition assessment must evaluate the quality of the breakdown, not only whether the final answer is correct. A student who decomposes perfectly but makes a single arithmetic error at the final step should score significantly higher than one who guesses the right answer without decomposing.
| Criterion | Level 4 — Exceeds | Level 3 — Meets | Level 2 — Approaching | Level 1 — Beginning |
|---|---|---|---|---|
| Clue / Constraint Identification | Identifies and correctly categorises all clues/constraints; notes any redundant or dependent clues explicitly | Identifies all main clues; minor error in categorisation of one clue | Identifies most but misses one clue entirely; no attempt at categorisation | Uses only 1–2 clues; others are ignored or not noticed |
| Ordering of Sub-problems | Explicitly sequences sub-problems in the optimal order; correctly identifies dependencies and justifies the order chosen | Generally correct order with one out-of-sequence step that doesn’t affect the answer | Solves in random or intuitive order; some sub-problems are revisited unnecessarily | No discernible sequence; attempts to solve the whole problem at once |
| State / Progress Tracking | Maintains a clear, complete record of state at each step (table, diagram, or annotated working); no information is lost | Tracks most steps; one transfer or exchange step is unclear or missing from record | Partial tracking; later steps show evidence of “lost” information from earlier steps | No tracking; relies on mental arithmetic across multi-step problems; frequent errors |
| Constraint Application | Applies every constraint correctly and in the right step; uses each constraint exactly once (no double-counting or skipping) | Applies most constraints correctly; minor error in one conditional constraint | Applies simple constraints; struggles with conditional (“if … then …”) constraints | Applies fewer than half the constraints; final answer violates one or more stated conditions |
| Verification | Checks the final answer against all original clues/constraints explicitly; identifies and corrects any inconsistency | Checks answer against most clues; misses verification of one constraint | Checks the most recent step only; does not re-verify against all original clues | No verification; accepts any answer reached at the end of working |
- Clue Sort Exit Slip: Give students 5 clues from a new problem. Ask only: “Sort these clues. Which would you solve first, and why?” No solving required — purely assesses decomposition thinking.
- Broken Decomposition Repair: Provide a worked solution with the sub-problems in the wrong order or with one step missing. Students identify and fix the error in the decomposition process (not just the arithmetic).
- State Table Completion: Give a half-filled state tracking table from a transfer problem. Students complete the remaining rows — tests whether they understand the structure of decomposed tracking.
- Explain to a Younger Student: Students write 3 sentences explaining how they would break down the problem for a Class 4 student. Forces explicit articulation of the decomposition process.
| Misconception / Challenge | Why it happens | How to address it |
|---|---|---|
| “I can hold all the steps in my head” | Students with strong working memory succeed on 2–3 step problems without tracking and then apply the same approach to 4–5 step problems, where it breaks down | Make state tracking a non-negotiable classroom norm from the start — even for easy problems. Frame it as a professional habit, not a crutch: “Engineers, doctors, and programmers all use state records. So do we.” |
| Applying clues in the order they are written, not the most efficient order | Students follow the text linearly — a natural reading habit that transfers poorly to multi-constraint problems | Require the Clue Sorting step before every problem in early lessons. Explicitly discuss: “Clue 3 eliminates 90 of the 100 possibilities. Why would we not start there?” |
| Confusing a conditional clue with an absolute clue | “A is before B” is absolute; “A is before B only if C is last” is conditional — students often treat both types the same | Colour-code clue types: absolute clues in blue, conditional clues in orange. Introduce the sentence frame: “IF ___ THEN ___” to rewrite conditional clues before applying them. |
| Declaring the answer before verifying all constraints | Students experience “answer relief” — once they reach a number or name that seems right, they stop checking | Build “Verify-All” as the final mandatory step on every problem card. Provide a checklist of original clues to tick off after reaching the answer. |
| Treating redundant information as a mistake or trick | Students who find a valid answer after using only 3 of 5 clues assume the other clues “don’t work” or that the problem is wrong | Explain redundancy explicitly: “Sometimes problems give you more information than the minimum needed. Consistent redundant clues confirm your answer. Inconsistent ones mean you’ve made an error.” |
| In visual/balance problems, trying to solve all shapes simultaneously | The visual nature of the problem makes it tempting to look at all scales at once and try to intuit values, rather than isolating one equation at a time | Cover all scales except the anchor with a blank card. Physically uncover one scale at a time during solving. This physical constraint enforces the decomposition habit. |
- Q: How is Decomposition different from problem-solving in general?
A: Problem-solving is the broad goal; Decomposition is a specific cognitive strategy within it. What distinguishes CT Decomposition is the explicit identification of sub-problems, their dependencies, and a deliberate sequencing of sub-problem resolution — not just “breaking it into steps” informally. The process must be documented and transferable. - Q: Logic grid puzzles look like puzzle/game activities — is this valid CT content?
A: Absolutely. Logic grid puzzles are a direct, unplugged representation of relational database queries, constraint-satisfaction algorithms, and AI planning problems. They are widely used in CS education globally. The CT value lies in the systematic elimination process, not the puzzle theme. - Q: Should students always draw a dependency diagram?
A: Not necessarily — for simpler problems, a numbered list of steps is sufficient. The dependency diagram is most valuable when students struggle with “which sub-problem to solve first.” Use it as a scaffolding tool that is gradually withdrawn as independence increases. - Q: How many periods are recommended for this LO?
A: 8–10 periods of 40 minutes is recommended. Distribute as: 1–2 periods introducing the 5-step decomposition process → 1 period per LO area → 2 periods for mixed/integrated problems. The Logic Grid activity alone warrants a full double period.
Complete this checklist after the training session to confirm readiness to teach Decomposition (Class 6 CT).
- I can explain all 6 LO sub-areas of Decomposition in my own words with one example each.
- I understand the difference between an absolute clue and a conditional clue.
- I can explain what “interdependence” means at Class 6 level and why it makes decomposition harder than step-listing.
- I can map the 5-step Decomposition Process to a problem type from each LO area.
- I can demonstrate Clue Sorting with a live mystery number problem.
- I can facilitate the State Tracking Table activity, including the deliberate “without the table” contrast experience.
- I can run the Logic Grid activity with full Clue Application Log documentation.
- I can explain and demonstrate the Anchor-and-Build strategy using a balance scale puzzle.
- I have materials prepared for at least 3 of the 5 activities in this module.
- I can apply the 5-criterion rubric and explain why process earns more marks than a lucky correct answer.
- I can design a Clue Sort Exit Slip for any new problem.
- I understand how to handle redundant information in a problem — and how to explain it to students.
- I know how to scaffold and then gradually withdraw the dependency diagram and state tracking table.