Complete SE File Harjinder Singh
Complete SE File Harjinder Singh
3. Data Flows: Arrows indicate the flow of data between external en es and the
system. The direc on of the arrows shows the direc on of data movement.
4. Single Process: The en re system is represented as a single process, o en labeled
with the name of the system. This process encapsulates all the func onali es 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 interac on
between the system and external en es.
Purpose of a Zero Level DFD:
Communica on Tool: It serves as a communica on tool between stakeholders,
including developers, clients, and users, to ensure a shared understanding of the
system's scope and interac ons.
Requirements Gathering: It helps in gathering and clarifying requirements by
iden fying what external en es need from the system.
System Overview: It provides a high-level overview of the system, making it easier to
understand the context in which the system operates.
Example:
Imagine a simple online shopping system. A zero-level DFD for this system might
include:
External En es: Customers, Payment Gateway, Inventory System.
Single Process: "Online Shopping System."
Data Flows:
Element Descrip on
High-Level Components
Component Descrip on
Product Catalog Service Manages product lis ngs, categories, and search.
Order Management
Handles order processing and order history.
Service
Admin Portal Interface for sellers or admin to manage the pla orm.
Authen ca on
Login Manager
Token Service (JWT)
Role-Based Access Control
Product Catalog
Product Search
Category Management
Product Reviews
Order Management
Invoice Generator
Refund Handler
Inventory
Stock Level Manager
Supplier Interface
Internet
Connec on Web Work Sta on
Server <<Host Device>>
Mobiles/PC
Internet Website
<<Devices>>
Connec on<<So ware>>
HTTP(S)
Internet
Connec on
HALSTEAD METRICES
Halstead’s So ware Metrics, developed by Maurice
Halstead in 1977, are a set of measures used to
quan fy various aspects of so ware programs.
According to Halstead’s, “A computer program is an
implementa on of an algorithm considered to be a
collec on 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 ac ons (operators) or upon which
ac ons are performed (operands). This dis nc on
helps in understanding and analysing the structure and
behaviour of the program.
{
int i, j, save, im1;
/*This func on 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