Composition and Decomposition
Chapter 2: Chapter 2 · Computer Science · EN medium
From your actual textbook ✓
What does your textbook say about Composition and Decomposition?
In Chapter , we saw that algorithms are composed of statements. Statements can be grouped into compound statements, giving rise to a hierarchical structure of algorithms. Decomposition is one of the elementary problem-solving techniques.An algorithm may be broken into parts, expressing only high level details. Then, each part may be refined into smaller parts, expressing finer details, or each part may be abstracted as a function.
📖 Namma Kalvi 11th Computer Science Textbook English Medium · Page 94
Read from the source
Complete lesson
In Chapter , we saw that algorithms are composed of statements. Statements can be grouped into compound statements, giving rise to a hierarchical structure of algorithms. Decomposition is one of the elementary problem-solving techniques.An algorithm may be broken into parts, expressing only high level details. Then, each part may be refined into smaller parts, expressing finer details, or each part may be abstracted as a function.
Related topics
Want this shaped for your exam marks?
Get an AI answer grounded in your actual textbook — with the exact page reference.
Ask AI about this topic →