1. Introduction to Flowcharts
Mrs. Lauren Taylor | Dardanelle High School | Computer Science Principles

2. History
Flowcharts were introduced by Frank Gilberth in 1921 and were called Process Flow Charts
Used to train business people – quickest way to complete a job or task
Became a popular took to describe computer algorithms

3. Computer Algorithms Instance of Logic
Effective for the intended target computers to produce output from given input
Optimal algorithms produce faster results

4. Friendship Algorithm

5. Flowchart Symbols
Decision
Start / End
Process
Input/Output
Arrows

6. Oval Start / End Called a “Terminator”
Usually contains the word “Start” or “End”
Begins and ends each flowchart process path
Start / End

7. Arrows Connects the symbols in your flowchart
Guides the reader through the sequence of process steps
Flow moves in the direction of the arrows
Arrows

8. Process Rectangle Used when you have only one possible next step
One arrow leaving this step
Indicates internal operation inside the processor or memory
Process

9. Diamond
Asks a question that can be answered in binary format (Yes/No or True/False)
Arrows representing different decisions emerge from different points
Requires a choice by the reader
Decision

10. Parallelogram or Rhombus
Standard input/output symbol
Represents material or information entering or leaving the system
Customer Order (input) or a product (output)
Obtain data or output results
Input/Output

11. Example Which shapes are the start and end points?
What is the process in this example?
How many times is there a decision?
When does the process end?

12. Practice Create a flowchart that finds the sum of 513 and 232
Think in terms of a calculator and the process it uses to calculate the sum of two numbers

13. Start
A = 513
B = 232
Display Sum = 745
End
Calculate Sum as
A + B