Oxford, Cambridge and RSA (OCR) GCSE Computer Science Practice Exam

The process of breaking a complex problem down into smaller, manageable problems is called decomposition. This approach allows for a more organized and systematic way to tackle intricate issues by simplifying them into parts that can be solved independently. By focusing on these smaller problems, it becomes easier to identify solutions, test them, and ultimately integrate them into a comprehensive solution for the original complex problem.

Decomposition is crucial in programming and computer science, as it helps in designing algorithms and managing tasks within large projects. This strategy not only enhances clarity and understanding but also improves collaboration among teams, as individuals can work on different components of a problem simultaneously.

The other options represent different concepts. Abstraction refers to reducing complexity by simplifying details, algorithmic thinking involves developing a step-by-step plan to solve problems, and iteration refers to the process of repeating steps until a desired outcome is achieved. While they all contribute to problem-solving, they do not specifically denote the act of breaking down problems into smaller parts as decomposition does.