What this course develops
Before learning a language, learn how to solve the problem. This course develops computational thinking, logical reasoning and algorithmic structure—the skills that make later programming much easier.
Course content
Problem decomposition
Turn a large problem into smaller solvable parts and identify what must happen first.
Inputs, processes & outputs
Describe clearly what information a solution receives, what it must do and what it should produce.
Algorithms
Write precise step-by-step solutions that can later be translated into code.
Flowcharts
Represent decisions and processes visually and follow the flow through alternative paths.
Pseudocode
Express algorithms in structured, language-neutral instructions.
Decisions & repetition
Understand conditions, branches, loops and the situations in which each is useful.
Debugging logic
Find contradictions, missing cases and inefficient steps before they become programming errors.
Problem-solving challenge
Design and justify a complete logical solution to a new problem.
Learning outcomes
- Decompose problems into logical components.
- Create algorithms using flowcharts and pseudocode.
- Understand sequence, selection and iteration.
- Identify logical errors before coding.
- Approach unfamiliar programming problems more systematically.
Teaching approach
Teaching is live and tutor-led. Concepts are explained, demonstrated and then applied through guided exercises. Learners are expected to make decisions, attempt tasks, test their work and discuss errors rather than simply watch a completed solution.
Delivery options
This course can be delivered online. In-person delivery can also be requested and is subject to location, tutor availability, programme scheduling and any equipment or venue requirements.
Who it is for
This is a beginner course suitable for learners who want structured development in programming. If you are unsure whether the starting level is right, use the application form to describe your current experience and we can review the request.