# 7.0 Module Overview: Algorithm Design and Problem-Solving

- **Track:** Cambridge IGCSE™ Computer Science (0478 / 0984) (CAMBRIDGE IGCSE 0478)
- **Module:** Section 7: Algorithm Design & Problem-Solving
- **Estimated Duration:** 5 minutes
- **Access:** Open Theory (All-Access for Interactive IDE & Autotests)

---

## Theory & Conceptual Background

Use this module to build one skill at a time, then apply it in a different situation. Read each worked example, explain its steps and attempt the exercises without copying the example. The mixed review is for retrieval now and after a delay.

## Lessons

- [Program Development Life Cycle (Analysis, Design, Coding, Testing)](/learn/igcse-0478/pdlc-stages)
- [System Decomposition & Structure Charts](/learn/igcse-0478/system-decomposition)
- [Cambridge Pseudocode Standards & Identifier Tables](/learn/igcse-0478/pseudocode-standards-and-identifiers)
- [Flowchart Symbols & Decision Logic](/learn/igcse-0478/flowchart-conventions)
- [Totalling, Counting & Sentinel Input Loops](/learn/igcse-0478/totalling-and-counting)
- [Finding Maximum, Minimum & Calculating Average](/learn/igcse-0478/calculating-stats-min-max)
- [Mean and Empty Data](/learn/igcse-0478/mean-and-empty-data)
- [Linear Search Algorithm on 1D Arrays](/learn/igcse-0478/linear-search)
- [Bubble Sort Algorithm with Swap Optimization](/learn/igcse-0478/bubble-sort)
- [Data Validation Checks (Range, Length, Type, Presence)](/learn/igcse-0478/validation-techniques)
- [Data Verification Methods (Double Entry & Visual Check)](/learn/igcse-0478/verification-methods)
- [Designing Test Data (Normal, Boundary, Extreme, Erroneous)](/learn/igcse-0478/test-data-types)
- [Trace Tables & Algorithm Dry-Run Execution](/learn/igcse-0478/trace-tables-and-dry-runs)
- [Error Detection, Debugging & Algorithm Correction](/learn/igcse-0478/error-detection-and-correction)
- [Mixed Practice: Algorithms](/learn/igcse-0478/algorithm-review)
- [Independent Scenario: Monitoring Readings](/learn/igcse-0478/integrated-scenario-readings)

## Study and feedback

Reading theory is open. Interactive access depends on your account and module access; the AI Tutor requires eligible All-Access membership. Structured checks provide feedback on specific answers. Written explanations and diagrams need comparison with the worked guidance and, where possible, a teacher's feedback. Passing a check is not a prediction of an exam grade.

## Programming before algorithms

Beginners should study module 8 through arrays before attempting module 7's search/sort programs. The module navigation places programming before algorithm practice; syllabus numbers remain available for reference. Revisit subroutines, files and the independent scenarios once their prerequisites are secure.

---

## Interactive Exercises & Autotest Specifications

### Exercise 1: Overview Check: How to study (Fill in blank, 5 XP)

**Instructions:**
Work out each answer before submitting. After reading a worked example, should you copy it or try new values?


**Starter Code:**
```text
{"prompt":"Overview Check: How to study","template":"1. After reading a worked example, should you copy it or try new values? [blank_1]","blanks":[{"id":"blank_1"}],"word_bank":["try new values","copy it directly","skip the practice"]}
```