FLOWCHART

WHAT IS FLOWCHART
WHAT IS FLOWCHART
They are graphical
representations of an algorithm.
It is a diagram that shows a
system, a process, or an
algorithm for a computer. It
includes a summary of the
crucial steps to addressing the
problem in addition to being a
diagrammatic representation of
the solution to a specific problem
 WHAT IS FLOWCHART

 Flowcharts are helpful when

graphical you write algorithms to
solve a program so you can
of an algorithm. imagine the flow better with
m that shows a graphics and symbols.
 They are handy when you
rocess, or an
need to explain your
a computer. It algorithm to others since it’s
mmary of the already properly laid out and
has geometric symbols for
o addressing the every purpose needed.
ition to being a
epresentation of
specific problem
FLOWCHART SYMBOL
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• INDICATES THE FLOW OF THE

FLOW LINES AND ARROW HEAD ALGORITHM
• CONNECTS SYMBOL TOGETHER.
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• INDICATES THE FLOW OF THE

FLOW LINES AND ARROW HEAD ALGORITHM
• CONNECTS SYMBOL TOGETHER.

• REPRESENT THE START AND THE END

TERMINAL (START/END) OF A FLOWCHART.
• A FLOWCHART SHOULD ALWAYS START
WITH AND END WITH A SYMBOL LIKE
THIS.
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• INDICATES THE FLOW OF THE

FLOW LINES AND ARROW HEAD ALGORITHM
• CONNECTS SYMBOL TOGETHER.

• REPRESENT THE START AND THE END

TERMINAL (START/END) OF A FLOWCHART.
• A FLOWCHART SHOULD ALWAYS START
WITH AND END WITH A SYMBOL LIKE
THIS.

INPUT/OUTPUT • USE FOR INPUT AND OUTPUT

PROCESSES.
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• INDICATES THE FLOW OF THE

FLOW LINES AND ARROW HEAD ALGORITHM
• CONNECTS SYMBOL TOGETHER.

• REPRESENT THE START AND THE END

TERMINAL (START/END) OF A FLOWCHART.
• A FLOWCHART SHOULD ALWAYS START
WITH AND END WITH A SYMBOL LIKE
THIS.

INPUT/OUTPUT • USE FOR INPUT AND OUTPUT

PROCESSES.

• USE TO REPRESENT A SINGLE STEP OR

ACTION OR PROCESS ACTION.
• USUALLY REPRESENTS ARITHMETIC
OPERATIONS AND DATA
MANIPULATIONS.
• MOST COMMON FLOWCHART SYMBOL.
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• REPRESENT A DECISION-MAKING POINT

DECISION • USUALLY HAS FLOW LINES COMING OUT
AFTER IT, REPRESENTING THE
DECISION PATHS FOR EACH
ALTERNATIVE (e.g., YES, NO)
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• REPRESENT A DECISION-MAKING POINT

DECISION • USUALLY HAS FLOW LINES COMING OUT
AFTER IT, REPRESENTING THE
DECISION PATHS FOR EACH
ALTERNATIVE (e.g., YES, NO)

• USUALLY COME IN PAIRS; INDICATES THAT

THE FLOW CONTINUES WHERE THE
ONE- PAGE CONNECTOR MATCHING SYMBOL
(WITH SAME LETTER) HAS BEEN PLACED.
• MUST HAVE A LETTER PLACES INSIDE THE
SYMBOL.
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• REPRESENT A DECISION-MAKING POINT

DECISION • USUALLY HAS FLOW LINES COMING OUT
AFTER IT, REPRESENTING THE
DECISION PATHS FOR EACH
ALTERNATIVE (e.g., YES, NO)

• USUALLY COME IN PAIRS; INDICATES THAT

THE FLOW CONTINUES WHERE THE
ONE- PAGE CONNECTOR MATCHING SYMBOL
(WITH SAME LETTER) HAS BEEN PLACED.
• MUST HAVE A LETTER PLACES INSIDE THE
SYMBOL.

• USUALLY COME IN PAIRS; USED TO CONNECT

THE FLOWCHART PORTION IN A DIFFERENT
OFF PAGE CONNECTOR PAGE
• MUST HAVE A LETTER PLACES INSIDE THE
SYMBOL
• USUALLY USE WHEN WRITING FLOWCHARTS
THAT NEED MORE THAN ONE PAGE.
FLOWCHART SYMBOL
SYMBOL NAME DESCRIPTION

• REPRESENT A DECISION-MAKING POINT

DECISION • USUALLY HAS FLOW LINES COMING OUT
AFTER IT, REPRESENTING THE
DECISION PATHS FOR EACH
ALTERNATIVE (e.g., YES, NO)

• USUALLY COME IN PAIRS; INDICATES THAT

THE FLOW CONTINUES WHERE THE
ONE- PAGE CONNECTOR MATCHING SYMBOL
(WITH SAME LETTER) HAS BEEN PLACED.
• MUST HAVE A LETTER PLACES INSIDE THE
SYMBOL.

• USUALLY COME IN PAIRS; USED TO CONNECT

THE FLOWCHART PORTION IN A DIFFERENT
OFF PAGE CONNECTOR PAGE
• MUST HAVE A LETTER PLACES INSIDE THE
SYMBOL
• USUALLY USE WHEN WRITING FLOWCHARTS
THAT NEED MORE THAN ONE PAGE.

• REPRESENT A SUBSEQUENCE OF STEPS THAT

PERFORM ONE SINGLE TASK EMBEDDED
SUBROUTINE SYMBOL WITHIN A LARGER PROCESS
• HAS DIFFERENT FLOWCHART TO DESCRIBE
THE PROCESS IN DETAILS
• USUALLY USE WHEN MAKING FUNCTIONS IN
CODING
 ADVANCE FLOWCHART SYMBOL

PROCESS TERMINAL DECISION MANUAL INPUT

PREDEFINED MANUAL
INPUT DATABASE
PROCESS OPERATION

DOCUMENT DELAY
ON-PAGE
MULTIDOCUMENT OPERATION

ALTERNATE
DATA PREPERATION
PROCESS MERGE

OFF-PAGE REFERENCE
 FOUR
FLOWCHART
STRUCTURE
FOUR FLOWCHART
STRUCTURE
SEQUENCE DECISION
START

START

YES NO
TEMP <
DO STEP A 32

COVER UNCOVER
DO STEP B TOMATO TOMATO

END
END
FOUR FLOWCHART
STRUCTURE
REPETITION
START

X=0

X < 10 ? END

X=0

X=0
FOUR FLOWCHART
STRUCTURE
CASE STRUCTURE

START

INPUT

DO STEP A DO STEP B DO STEP C DO STEP D

END
 All boxes of the flowchart are connected with Arrows. (Not lines)

Flowchart symbols have an entry point on the top of the symbol with
no other entry points. The exit point for all flowchart symbols is on the
bottom except for the Decision symbol.

The Decision symbol has two exit points; these can be

on the sides or the bottom and one side.

Generally, a flowchart will flow from top to bottom. However, an

upward flow can be shown as long as it does not exceed 3
GENERAL RULES FOR symbols.
FLOWCHARTING
Connectors are used to connect breaks in the flowchart.

Subroutines and Interrupt programs have their own and

independent flowcharts.
All flow charts start with a Terminal or Predefined
Process (for interrupt programs or subroutines) symbol.

All flowcharts end with a terminal.

DIFFERENT TYPES OF
FLOWCHARTS
PROCESS FLOWCHART

A process flowchart is
a diagram that shows
the sequential steps of
a process and the
decisions needed to
make the process work.
SWIMLANE FLOWCHART
A swim lane diagram is a type of flowchart that delineates who does what in a
process.
 WORKFLOW PROCESS

The definition of "workflow

process" is this: It refers to a
series of activities or tasks
that must be completed
sequentially or parallel to
achieve a business outcome.
DATA FLOW DIAGRAM

A data flow diagram (DFD)

maps out the flow of
information for any
process or system. It uses
defined symbols like
rectangles, circles and
arrows, plus short text
labels, to show data
inputs, outputs, storage
points and the routes
between each destination.
EXAMPLE:

Write an algorithm to find area of a rectangle

START
Step 1: Start

Step 2: Get L, B values GET L, B

Step 3: Calculate A=L*B A=L*B

Step 4: Display A
PRINT A

Step 5: Stop
END
 Write an algorithm that will check greatest of two numbers

START

Step 1: Start
GET A,B

Step 2: Get a, b value

YES NO
IS
Step 3: Check if (a>b) print a is (A>B)

greater

Step 4: Else b is greater

Step 5: Stop END