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.

Showing a random 20 of 50 problems.

Example 1

easy
In a flowchart, which shape represents a DECISION (yes/no question)?

Example 2

medium
Should the same flowchart be shown to engineers and to first-time users?

Example 3

easy
Which flowchart shape represents INPUT or OUTPUT (e.g., read a number, print a result)?

Example 4

hard
Compare: when is a flowchart better than pseudocode, and when is pseudocode better?

Example 5

medium
A diamond in a flowchart has only ONE outgoing arrow. What defect is this?

Example 6

medium
A flowchart shows a process box that points back to itself with no decision in between. What problem is this?

Example 7

challenge
A flowchart's two branches of a decision both rejoin the same downstream rectangle. What programming construct does this rejoin represent?

Example 8

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

Example 9

medium
Why is a flowchart useful for explaining a loop with a parent or non-programmer?

Example 10

easy
True or false: arrows in a flowchart show the order of execution.

Example 11

medium
Trace: Start -> [x=10] -> <x>5?> yes-> [x=x-5] -> back to diamond; no-> [print x]. What prints?

Example 12

easy
What does an oval shape in a flowchart represent?

Example 13

medium
Trace a loop flowchart: Start -> [i=1, s=0] -> <i <= 3?> --yes--> [s=s+i; i=i+1] -> back to diamond; --no--> [print s]. What prints?

Example 14

hard
Trace: Start -> [n=20,c=0] -> <n>1?> yes-> [if n even: n=n/2 else n=3n+1; c=c+1] back; no-> print c -> End. What prints? (Collatz from 20)

Example 15

easy
Trace: Start -> [x=8] -> <x>10?> yes->[print BIG]; no->[print SMALL] -> End. What prints?

Example 16

medium
Trace: Start -> [n=4] -> <n even?> --yes--> [print EVEN] -> End; --no--> [print ODD] -> End. Printed?

Example 17

medium
A flowchart has a process box with NO outgoing arrow (a dead end before End). What is the defect?

Example 18

medium
Trace: Start -> [a=4,b=6] -> <a>b?> yes->[m=a] no->[m=b] -> [print m] -> End. What prints?

Example 19

medium
Trace: Start -> [n=12] -> <n%2==0?> yes->[print EVEN] no->[print ODD] -> End. What prints?

Example 20

medium
Trace: Start -> [a=2,b=3] -> <a>b?> yes->[m=a] no->[m=b] -> [print m]. What prints?