Skip to content

Computational Thinking Foundations

Summary

This chapter introduces the vocabulary of computational thinking, including decomposition, pattern recognition, abstraction, algorithm design, and precise instructions. Students learn to break problems into steps, recognize ambiguity in instructions, and think about efficiency, reusability, and iterative design before writing any code. These ideas form the mental toolkit that the rest of the course builds on. After completing this chapter, students will be able to describe a problem-solving process in clear, step-by-step, unambiguous terms.

Concepts Covered

This chapter covers the following 16 concepts from the learning graph:

  1. Computational Thinking
  2. Decomposition
  3. Pattern Recognition
  4. Abstraction
  5. Algorithm Design
  6. Algorithm
  7. Problem Solving
  8. Step-By-Step Thinking
  9. Precise Instructions
  10. Ambiguity In Instructions
  11. Generalization
  12. Efficiency Of A Solution
  13. Reusability
  14. Computational Artifact
  15. Iterative Design
  16. Planning Before Coding

Prerequisites

This chapter assumes only the prerequisites listed in the course description.


TODO: Generate Chapter Content