Flowchart Examples in CS Thinking
Start with the recap, study the fully worked examples, then use the practice problems to check your understanding of Flowchart.
This page combines explanation, solved examples, and follow-up practice so you can move from recognition to confident problem-solving in CS Thinking.
Concept Recap
A visual diagram that represents the steps of an algorithm using standard shapes (ovals for start/end, rectangles for processes, diamonds for decisions, arrows for flow).
A flowchart is a map of your algorithm โ you can trace the path from start to finish and see every decision point along the way.
Read the full concept explanation โHow to Use These Examples
- Read the first worked example with the solution open so the structure is clear.
- Try the practice problems before revealing each solution.
- Use the related concepts and background knowledge badges if you feel stuck.
What to Focus On
Core idea: Flowcharts make control flow visible. They're especially useful for understanding loops and branching logic.
Common stuck point: Diamonds are for decisions (yes/no questions) only. Rectangles are for actions/processes.
Worked Examples
Example 1
easySolution
- 1 Step 1: Oval (rounded rectangle) = Start/End (terminator). Rectangle = Process (an action or calculation).
- 2 Step 2: Diamond = Decision (a yes/no question that creates a branch). Parallelogram = Input/Output (data entering or leaving the system).
- 3 Step 3: Arrows connect the symbols to show the flow of control from one step to the next.
Answer
Example 2
mediumPractice Problems
Try these problems on your own first, then open the solution to compare your method.
Example 1
mediumExample 2
hardRelated Concepts
Background Knowledge
These ideas may be useful before you work through the harder examples.