Decomposition
Splitting a task into smaller named steps, each small enough to write and check on its own, so a big program reads as a story of calls.
Depth 1 · Foundation
You can split a task top-down into small functions with one job each, keep input and output at the edges, and read a program by following its calls from the top.
Sign in to prove what you know with a short quiz, see how deep you've gone, and earn XP for it.
Sign in with GoogleDepths of understanding
- 1
Foundation
You can split a task top-down into small functions with one job each, keep input and output at the edges, and read a program by following its calls from the top.
- 2
Deeper
You can plan a whole program before writing it - the data it keeps, the functions that work on it, the classes that group them and the tests that check each piece, in that order.
Your path here
What's still between you and Decomposition, depth 1, in the order you can learn it.
- 1ProgramDepth 1 · Foundation · Program Basics
- 2ExpressionDepth 1 · Foundation · Program Basics
- 3Variables in codeDepth 1 · Foundation · Program Basics
- 4Program stateDepth 1 · Foundation · Program Basics
- 5Input and outputDepth 1 · Foundation · Program Basics
- 6Functions in codeDepth 1 · Foundation · Functions
- 7Return valuesDepth 1 · Foundation · Functions
- 8ScopeDepth 1 · Foundation · Functions
- 9DecompositionDepth 1 · Foundation · Functions
Where it fits
Builds on
This concept