SCCC
SCCC
1. System Boundary: The diagram defines the scope of the system, showing what is
included and what is external to the system.
2. External Entities: These are the actors (users, other systems, etc.) that interact with
the system. They are represented as rectangles.
3. Data Flows: Arrows indicate the flow of data between external entities and the
system. The direction of the arrows shows the direction of data movement.
4. Single Process: The entire system is represented as a single process, often labeled
with the name of the system. This process encapsulates all the functionalities of the
system.
5. No Internal Processes or Data Stores: Unlike lower-level DFDs, a zero-level DFD does
not show internal processes or data stores. It focuses solely on the interaction
between the system and external entities.
Example:
Imagine a simple online shopping system. A zero-level DFD for this system might
include:
Data Flows:
The Online Shopping System requests inventory status from the Inventory
System.
In summary, a Zero Level DFD is a foundational tool in software engineering that helps
visualize the interactions between a system and its external environment, providing
a clear and concise overview of the system's functionality.
The context level data flow diagram (dfd) is describe the whole system. The (o) level dfd
describe the all user module who operate the system. Below data flow diagram of
online shopping site shows the two user can operate the system Admin and
Member user.
2. External Entities: These remain the same as in the Zero Level DFD, representing users
or systems that interact with the system.
3. Data Flows: Arrows indicate the flow of data between external entities and the sub-
processes, as well as between the sub-processes themselves.
4. Data Stores: One Level DFDs can also include data stores, which represent where
data is stored within the system. These are typically shown as open-ended
rectangles.
5. More Detail: The One Level DFD provides a clearer understanding of how the system
operates internally, showing the relationships and interactions between different
components.
Example:
Continuing with the online shopping system example, a One Level DFD might break down
the "Online Shopping System" process into several sub-processes, such as:
Data Flows:
The Admin side DFD describe the functionality of Admin, Admin is a owner of the website.
Admin can first add category of item and then add items by category wise. and admin can
manage order and payment detail.
Element Description
A modular part of a system that encapsulates its content and
¶u´◆J, Component
exposes interfaces.
–'‘c•. Executable software pieces (like .jar, .dll) that a component can
•⬛ represent.
Artifacts
Component Description
Order Management
Handles order processing and order history.
Service
,ºt Authentication
Login Manager
Token Service (JWT)
Role-Based Access Control
⬛묉 u, Product Catalog
Product Search
Category Management
Product Reviews
) Order Management
Invoice Generator
Refund Handler
,J¶◆´u Inventory
Stock Level Manager
Supplier Interface
Internet
Connection Web Work Station
Server <<Host Device>>
<<Online
ISP Private
Service>>
New
Internet
Connection
Private
NW
Mobiles/PC
Internet Website
<<Devices>>
Connecti on<<Software>>
HTTP(S)
Internet
Connection
HALSTEAD METRICES
Halstead’s Software Metrics, developed by Maurice
Halstead in 1977, are a set of measures used to
quantify various aspects of software programs.
According to Halstead’s, “A computer program is an
implementation of an algorithm considered to be a
collection of tokens which can be classified as either
operators or operand”. This means that the program
consists of various symbols and data elements that are
either performing actions (operators) or upon which
actions are performed (operands). This distinction
helps in understanding and analysing the structure and
behaviour of the program.
{
int i, j, save, im1;
/*This function sorts array x in ascending order */
If (n< 2) return 1;
for (i=2; i< =n; i++)
{
im1=i-1;
for (j=1; j< =im1; j++)
if (x[i] < x[j])
{
Save = x[i];
x[i] = x[j];
x[j] = save;
}
}
return 0;
}
int 4 sort 1
() 5 x 7
, 4 n 3
[] 7 i 8
if 2 j 7
< 2 save 3
; 11 im1 3
for 2 2 2
= 6 1 3
– 1 0 1
<= 2 – –
++ 2 – –
return 2 – –
{} 3 – –
Vocabulary (n) = 24