Practice Flowchart in CS Thinking

Use these practice problems to test your method after reviewing the concept explanation and worked examples.

Quick Recap

A visual diagram that represents the steps of an algorithm using standard shapes: ovals for start and end, rectangles for processes or actions, diamonds for decisions (yes/no questions), parallelograms for input/output, and arrows to show the flow of execution between steps.

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.

Example 1

easy
Name the four standard flowchart symbols and what each represents.

Example 2

medium
Describe the flowchart for a program that keeps asking the user to enter a password until they enter the correct one ('secret123'), then outputs 'Access granted'.

Example 3

medium
Describe the flowchart for a program that reads a number and outputs whether it is positive, negative, or zero.

Example 4

hard
Compare the strengths and weaknesses of flowcharts vs pseudocode for designing algorithms. When would you choose each?
← Back to Flowchart Worked Examples