C1
Computational Thinking
Decomposition, pattern recognition, abstraction, and algorithm design — plus flowcharts and a selection-sort case study.
IT · Semester 2
IPST's Technology (Computing Science) textbook for Grade 8 (M.2 / Mattayom 2), Semester 2 — the four chapters in our syllabus, drilled down one at a time. A few sub-sections were missing pages in the scanned source and are marked as such below rather than invented.
C1
Decomposition, pattern recognition, abstraction, and algorithm design — plus flowcharts and a selection-sort case study.
C2
Boolean operators, while loops, if/elif/else, and functions — with an interactive step-through simulator.
C3
Custom blocks, boolean blocks, and passing parameters — the same concepts as Ch.2, in block form.
C4
Hardware, operating systems and utilities, the CPU machine cycle, input/output devices, and memory vs. storage — with sorting games. Book pp. 90–91 and 94–97 (incl. §4.3) are a scan gap.
Chapters 1–4 are in the syllabus — Ch.4 flags its scan gaps inline.