Decomposition and abstraction, structured pseudocode, control structures, flowcharts, and measuring algorithm efficiency with Big-O.
Computational thinking
Decomposition — breaking a problem into smaller, manageable sub-problems that can be solved separately.
Abstraction — removing unnecessary detail to focus on the essentials (e.g. a map shows roads, not every building).
Pattern recognition — spotting similarities to reuse solutions.
These make problems easier to understand, solve and maintain, and support modular programming.
Viewing only
This content is free to read on superexams.com and cannot be printed or downloaded.
Read the full note, free
Create a free account to read this note in full. Every free account gets 2 complete revision notes, no card needed.