FLOWCHART

FLOWCHART
A flowchart is a type of diagram
that represents an algorithm,
workflow or process, showing the
steps as boxes of various kinds,
and their order by connecting them
with arrows.
 FLOWCHART
• Represents an algorithm or process
• Illustrates a solution to a given problem
• Represented Process operations
• Used in analyzing
• Used in designing
• Used in documenting
• Used in managing a process
• Used in program in various fields
CONTEXT DIAGRAM
 CONTEXT DIAGRAM
A context diagram represents a high-level view of the overall
business or system boundary of interest.

A system context diagram (SCD) in software

engineering and systems engineering is a diagram that defines the
boundary between the system, or part of a system, and its
environment, showing the entities that interact with it. This diagram is
a high level view of a system.

https://en.wikipedia.org/wiki/System_context_diagram
CONTEXT DIAGRAM
 CONTEXT DIAGRAM
Another name for a Context Diagram is a Context-Level Data-Flow
Diagram or a Level-0 Data Flow Diagram. Since a Context Diagram is a
specialized version of Data-Flow Diagram, understanding a bit about
Data-Flow Diagrams can be helpful.

A Data-Flow Diagram (DFD) is a graphical visualization of the movement

of data through an information system. DFDs are one of the three
essential components of the structured-systems analysis and design
method (SSADM).

https://en.wikipedia.org/wiki/System_context_diagram
 CONTEXT DIAGRAM
Some of the benefits of a Context Diagram are:

• Shows the scope and boundaries of a system at a glance including

the other systems that interface with it
• No technical knowledge is assumed or required to understand the
diagram
• Easy to draw and amend due to its limited notation
• Easy to expand by adding different levels of DFDs
• Can benefit a wide audience including stakeholders, business
analyst, data analysts, developers

https://en.wikipedia.org/wiki/System_context_diagram
CONTEXT
DIAGRAM
DATA FLOW DIAGRAM
 DATA FLOW DIAGRAM [DFD]
A data flow diagram (DFD) is a graphical representation of the
"flow" of data through an information system, modelling its
process aspects. A DFD is often used as a preliminary step to
create an overview of the system, which can later be
elaborated.

https://en.wikipedia.org/wiki/System_context_diagram
 Three data flow and process

● Spontaneous generation – produces output, but has no input data

flow.
● Black hole – a process that has input but produces no output.
● Gray hole – process that has at least one input and one output, but
the input obviously is insufficient to generate output.
 DATA FLOW DIAGRAM [DFD]
In the late 1970s data-flow diagrams (DFDs) were introduced and popularized
for structured analysis and design (Gane and Sarson 1979). DFDs show the
flow of data from external entities into the system, showed how the data moved
from one process to another, as well as its logical storage.

See more at: http://www.agilemodeling.com/artifacts/dataFlowDiagram.htm#sthash.dHBO8Svm.dpuf

DATA FLOW
DIAGRAM
[DFD]
 DATA FLOW DIAGRAM
A DFD is process centric and depicts 4 main components.

• Processes (circle)
• External Entities (rectangle)
• Data Stores (two horizontal, parallel lines or sometimes
and ellipse)
• Data Flows (curved or straight line with arrowhead
indicating flow direction)

https://en.wikipedia.org/wiki/System_context_diagram
 DATA FLOW DIAGRAM [DFD]
• Squares representing external entities, which are sources or destinations of
data.
• Rounded rectangles representing processes, which take data as input, do
something to it, and output it.
• Arrows representing the data flows, which can either be electronic data or
physical items.
• Open-ended rectangles representing data stores, including electronic stores
such as databases or XML files and physical stores such as filing cabinets or
stacks of paper.

See more at: http://www.agilemodeling.com/artifacts/dataFlowDiagram.htm#sthash.dHBO8Svm.dpuf

RULES OF DFD
PROCESS:
A. No process can have only
outputs. It is making data from
nothing. If an object has only
outputs, then it must be a
source.
B. No process can have only
inputs. If an object has only
inputs, then it must be a source.
C. A process has a verb phrase
label.
Physical Process Notation

ID (optional)
Action Verb
+
Noun or Object
Phrase
Implementation

13-18
Samples of Physical Processes
 Data Store:
D. Data cannot move directly from F. Data cannot move directly to an
one data store to another data outside sink from a data store.
store. Data must be moved by a
process.
E. Data cannot move directly from
an outside source to a data store. G. A data store has a noun phrase
Data must be moved by a process label.
that receives data from the source
and places the data into the data
store.
 Physical Data Stores

A physical data store represents the planned implementation of one of:

○ A database
○ A table in a database
○ A computer file
○ A tape or media backup of anything important
○ A temporary file or batch
○ Any type of non-computerized file
Source/Sink:

H. Data cannot move directly from a source to a sink. It must be

moved by a process if the data are of any concern to our
system.
I. A source/sink has a noun phrase label.
 Physical Data Flows
A physical data flow represents:
○ Planned implementation of an input to, or
output from a physical process. Implementation method:
○ Database command or action such as create, Data flow name
read, update, or delete.
○ Import of data from, or export of OR
data to another information system.
○ Flow of data between two modules Data flow name
or subroutines (represented
as physical processes). (Implementation method)
 Data Flow:

J. A data flow has only one direction of flow between symbols. It may flow in both
directions between a process and a data store to show a read before an update.
The latter is usually indicated, however, by two separate arrows since these
happen at different times.
K. A fork in a data flow means that exactly the same data goes from a common
location to two or more different processes, data stores, or sources.
 Data Flow:

L. A join in a data flow means that exactly the same data comes from any of two
or more different processes, data stores, or sources to a common location.
M. A data flow cannot go directly back to the same process it leaves. There must
be at least one other process that handles the data flow, produces some other
data flow, and returns the original data flow to the beginning process.