CS8 · Thinking / Design 1 / Design 2 / Search 1 Computational thinking and algorithms mind map
Use your browser’s Print command for A4 landscape, or choose A3 in its paper settings. The SVG remains sharp when enlarged. A text version follows the map.
Read the mind map as text
Thinking
Decomposition: Split a problem into manageable subproblems
Abstraction: Keep relevant details and omit distractions
Algorithmic thinking: Develop precise ordered steps to solve the problem
Design 1
Inputs processes outputs: Define the information flow before coding
Structure diagrams: Show subdivisions and their relationships
Pseudocode and flowcharts: Represent a procedure clearly
Selection and iteration: Branch on conditions and repeat appropriately
Design 2
Trace tables: Record values as instructions execute
Tracing a branch: Only the selected path executes
Correcting algorithms: Use counterexamples to locate a defect
Refining requirements: Handle boundaries empty cases and termination
Search 1
Linear search: Check items one by one until found or exhausted
Linear-search example: Searching an unsorted list follows its order
Binary search: Repeatedly halve a sorted search interval
Binary-search example: Discard the half that cannot contain the target
Connections
Thinking → Design 1: Decomposition and abstraction help specify precise procedures.
Design 2 → Search 1: Tracing and edge-case review check whether a search follows its intended steps.
