Notes · Class 11 · CBSE · Science Computer Science
Introduction to Problem Solving notes
Revision notes for the chapter: the key points, definitions and exam tips to remember.
Problem solving with computers follows clear steps from understanding to testing.
STEPS
- 1.Analyse the problem (understand inputs and outputs).
- 2.Develop an algorithm.
- 3.Code it in a programming language.
- 4.Test and debug.
ALGORITHMS
- A finite sequence of clear steps to solve a problem.
- Characteristics: precise, finite, input, output, uniqueness.
REPRESENTATIONS
- Flowchart symbols: oval (start/end), parallelogram (input/output), rectangle (process), diamond (decision), arrows (flow).
- Pseudocode: plain-language steps (INPUT, COMPUTE, PRINT, IF/ELSE, WHILE).
FLOW OF CONTROL
- Sequence, selection (if/else), repetition (loops).
VERIFYING ALGORITHMS
- Dry run with sample inputs.
- Compare algorithms by time and space.
DECOMPOSITION
- Break a complex problem into smaller sub-problems.
DEBUGGING
- Syntax errors, logical errors, runtime errors.
Memory hook: "Analyse, Algorithm, Code, Test — AACT."
Introduction to Problem Solving: practice questionsIntroduction to Problem Solving cheat sheet
More Class 11 · CBSE · Science Computer Science notes
Practise Introduction to Problem Solving
Sign up free to practise the full chapter after revising. Questions you get wrong come back until you've mastered them.
Start practising freeFree to start · No credit card needed