Data Flow Diagrams
Data Flow Diagrams
and
Data Flow Diagrams
Organised by
Software Engineering Team
CSED
•UCS503- Software Engineering
Learning Objectives
Understand the logical modeling of processes
through studying data flow diagrams
• Select a meaningful
name to represent the
data
• Number of process as
well as name are
recorded
• system boundaries
A data flow
diagrams (DFD)
that represents
system’s major
processes
data flows
data stores at Decoupled
a higher level
• Level-N Diagrams
– A DFD that is the result of n nested
decompositions of a series of subprocesses
from a process on a level-0 diagram
• Level 1
diagram has
one additional
data flow, C
B. No process
can have
only inputs
(black hole)
C. A process
has a verb
phrase
label
(except
for context
diagram)
I. A source/sink has a
noun phrase label
K. A fork means
that exactly the
same data go
from a
common
location to two
or more
processes,
data stores or
sources/sinks
T. To avoid having data flow lines cross each other, you may repeat data
stores or sources / sinks on a DFD.