← Course overview

Algorithm Valley

Class 5 · Algorithms, block coding & first data ideas · 13 chapters

Sign up to save XP
0% complete

Inspired by upper-primary computational-thinking learning outcomes.

Chapter 1 of 13 12 min

Breaking big problems down

Story

Aanya and Vihaan reach a new challenge: "Breaking big problems down". Think about class picnic.

Pixel beeps: "Don't just read about it — let's learn by DOING. Try the demo below! "

The idea

Decomposition. Decomposition splits a big task into small, easy steps. Programmers solve every problem this way.

Smallest first step. When a problem feels huge, find the smallest first step — it makes the next step clearer.

Indian-life example — Class picnic

Pick a date → count students → arrange snacks → list games → get permission.

Interactive demo — do it yourself
Pixel · Step 1 of 4

Tap an example, then tap the box where it belongs: did the AI LEARN it, or is it a FIXED rule?

AI learned (0)
Fixed rule (0)
Practice — your turn

Decomposition means…

Recap
  • Decomposition
  • Smallest first step
+15 XP on complete

Finish the demo and practice above to continue.