Introduction to Problem Solving
Class 11 · Computer Science
4 ideas in Class 11 Computer Science, explained in plain words, with games and quizzes to practise.
Algorithm Qualities
Part of: Algorithms and Steps
Algorithms list finite, clear, ordered steps; inputs, outputs defined; terminate correctly.
Why it matters. Steps precise. Results correct.
Key words
- Algorithm
- : A finite list of clear ordered steps solving a problem.
- Input
- : The data an algorithm starts from, stated before the steps.
- Output
- : The result an algorithm must produce after its steps.
- Termination
- : The sure ending of an algorithm after a finite number of steps.
Try it in two minutes
- Define input, output.
- Order clear steps.
- Ensure finish.
Try at home. Write tea steps.
Flowcharts
Part of: Algorithms and Steps
Flowcharts draw logic: ovals start, parallelograms input, rectangles process, diamonds decide, arrows flow.
Why it matters. Logic seen. Errors spotted.
Key words
- Flowchart
- : A diagram drawing the logic of a solution with fixed shapes.
- Terminal
- : The oval marking the start and stop of a flowchart.
- Process box
- : The rectangle holding a computation or assignment step.
- Decision diamond
- : The diamond branching flow on a yes-or-no test.
- Flow lines
- : The arrows showing the direction of movement between shapes.
Try it in two minutes
- Start oval.
- Process boxes.
- Decide diamonds.
Try at home. Chart morning routine.
Pseudocode Basics
Part of: Pseudocode and Tracing
Pseudocode writes logic in plain lines with INPUT, COMPUTE, PRINT, IF, WHILE; language-free drafts.
Why it matters. Logic drafted. Code follows.
Key words
- Pseudocode
- : Plain-line logic draft using INPUT, COMPUTE, PRINT, IF and WHILE.
- INPUT step
- : The line stating what data the solution reads.
- COMPUTE step
- : The line stating the calculation done on the data.
- IF step
- : The line branching action on a stated condition.
Try it in two minutes
- State input.
- Write steps.
- State output.
Try at home. Draft sum steps.
Tracing Outputs
Part of: Pseudocode and Tracing
Trace steps with sample values; loops add, counters rise; dry runs verify logic before coding.
Why it matters. Outputs predicted. Logic verified.
Key words
- Dry run
- : A hand walk through steps with sample values before coding.
- Trace table
- : A row-by-row record of changing values during a dry run.
- Counter
- : A variable rising by steps to count loop rounds.
- Loop trace
- : Following repeated steps round by round to predict the result.
Try it in two minutes
- Pick sample values.
- Walk each step.
- Note the output.
Try at home. Trace a loop.
What your child will practise
- Algorithm Qualities: Desert Puzzle (Clue Puzzle)
- Algorithm Qualities: Desert Quick Fire (Quick Fire)
- Flowcharts: Space Puzzle (Clue Puzzle)
- Pseudocode Basics: Desert Quest (Flip and Match)
- Tracing Outputs: Jungle Quick Fire (Quick Fire)
- Quiz: Algorithm Qualities (8 questions)
- Quiz: Flowcharts (8 questions)
- Quiz: Pseudocode Basics (8 questions)
- Quiz: Tracing Outputs (8 questions)