AIR RESERVATION Rest
AIR RESERVATION Rest
omm
3.1.1 Functional Point Estimation
GRADE
cco
VALUE
a.
2 Are specialized data communications required to transfer 3
information to or from the application?
4
iy
Are there distributed processing functions?
Is performance critical?
4
0
un
5 Will the system run in an existing, heavily utilized operational 5
environment?
slsD
7 Does the on-line data entry require the input transaction to be built 4
over multiple screens or operations?
aial
16 | P a g e
VALUE ADJUSTMENT FACTORS, Σfi = 47
omm
1. EXTERNAL 3 4 12
INPUT
cco
2. EXTERNAL 4 5 20
a.
OUTPUT
3. EXTERNAL
INQUIRIES
iy 1 5 5
un
4. NUMBER OF 1 10 10
LOGICAL
FILES
slsD
5. EXTERNAL 1 7 7
INTERFACE
FILES
aial
TOTAL 54
orri
utot
= 60.48
17 | P a g e
3.1.2 Efforts
omm
Cost per FP = $1230
= 60.48 /6.5
cco
=9.304 person months
a.
Total cost for the project = Total efforts * labour rate
= 9.304 * 8000
iy = $74432
un
slsD
aial
orri
utot
TTu
18 | P a g e
3.2 Risk Table
omm
Lack of skill ST 40% 2 External resources might help
cco
development.
a.
product validation is critically
important. You need to
attempted
finalising them
schedule
TTu
1-Catastrophic
2-Critical
3-Marginal
4-Negligible
19 | P a g e
PD-Process Definition
DE-Development Environment
CU-Customer Characteristics
omm
BU-Business Impact
PS-Product Size
cco
a.
iy
un
slsD
aial
orri
utot
TTu
20 | P a g e
3.3 Timeline
Wk 1 Wk 2 Wk 3 Wk 4 Wk 5 Wk 6 Wk 7 Wk 8 Wk 9 Wk 10 Wk 11 Wk 12
omm
1. Identify Customer
Requirements
Meet with customers
Identify needs and
constraints
cco
Establish Problem
Statement
MILESTONE: Problem
a.
statement defined
2. Define function
behaviour
Identify modules
Define DFDs
iy
un
Develop ERDs
MILESTONE: System
Functions defined
3. Estimation
slsD
Formulate System
Architecture
Generate Code
orri
21 | P a g e
4 Design Engineering
omm
SEAT RESERVATION
AND UPDATION
cco
a.
RETRIEVE TOTAL COST TICKET SEAT CANCELLATION
AND DISPLAY CALCULATION GENERATION ALLOCATION
iyDISPLAY
un
TOTAL COST GENERATE
OF THE TRIP BOARDING PASS
slsD
PAYMENT USER ID
orri
utot
TTu
22 | P a g e
4.2 Data Design
TRIP DETAILS
SOURCE VARCHAR(30)
omm
DESTINATION VARCHAR(30)
DATE INT
cco
NUMBER OF SEATS INT
CATEGORY CHAR
a.
PLANE NUMBER INT
iy
un
TICKET
NAME VARCHAR(30)
SOURCE VARCHAR(30)
slsD
DESTINATION VARCHAR(30)
DATE INT
aial
ID INT
orri
utot
CUSTOMER
TTu
NAME VARCHAR(30)
AGE INT
E-MAIL VARCHAR(30)
PHONE LONG
GENDER CHAR
23 | P a g e
ADDRESS VARCHAR(30)
BOARDING PASS
omm
ID INT
cco
a.
4.3 Component Level Design
PSEUDOCODE
iy
un
1 int mode, plno;
2 reserve()
3 cout<<"\nName - ";
aial
cin.getline(name,20);
orri
cout<<"\nAddress : ";
cin.getline(addr,20);
utot
cout<<"\nE-Mail ID : ";
TTu
cin.getline(email,20);
cout<<"\nTelephone no : ";
cin>>phone;
cin>>date;
24 | P a g e
4 while(r)
5 r.getline(ch,250);
cout<<ch<<endl;
end of while
omm
cin>>mode;
7 if(mode==1)
cco
cout<<"\nEnter the plane 1 or 2 or 3 : ";
8 cin>>plno;
a.
9 switch(plno)
10
iy
case 1: strcpy(pname,"D1");
strcpy(source,"Delhi");
un
strcpy(dest,"Mumbai");
strcpy(dep,"10:00");
slsD
strcpy(arrv,"11:00");
break;
case 2: strcpy(pname,"D2");
aial
11 strcpy(source,"Mumbai");
strcpy(dest,"Kolkata");
orri
strcpy(dep,"12:00");
utot
strcpy(arrv,"13:15");
break;
TTu
12 else if(mode==2)
cin>>plno;
14 switch(plno)
case 1: strcpy(pname,"I1");
25 | P a g e
15 strcpy(source,"Mumbai");
strcpy(dest,"London");
strcpy(dep,"00:30");
strcpy(arrv,"10:30");
break;
omm
case 2: strcpy(pname,"I2");
16 strcpy(source,"Delhi");
cco
strcpy(dest,"Paris");
strcpy(dep,"03:20");
a.
strcpy(arrv,"13:20");
17
iy
randomize();
break;
un
pword=random(100);
26 | P a g e
5 Testing
TEST CASES
omm
cco
TEST NAME ADDRESS EMAIL ID PHONE DATE MODE PLANE PASSWORD EXPECTE
CASE NUMBER D
ERROR
a.
1 sahil 100, id1@yahoo. 1111111 3 1 1 131 ---
west_encl co.in
2 vikash iy
ave
delhi
45/34,sec co.in
tor6,delhi
aial
esh
TTu
27 | P a g e
8 Omn 56,umanr idabc@yah 1117890 1 7 Plane
oad,himac oo.co.in number
hal should be
either 1
or 2 or 3
omm
oad,ch-17 ddsabc@ya cannot be
hoo.co.in greater
than 30
character
cco
10 Ankit 100,uman, ida23c@ya 2345678 Address
Chennai, hoo.co.in must be
Tamil less than
Nadu 30
a.
character
and
should
iy not have
white
spaces.
un
11 Abc Gaziabad, idabc@yah 11111112 Phone
u.p oo.co.in 22222222 number
22444445 cannot be
555555 greater
slsD
than 30
character
17 greater
than 30
character
orri
and year
from date
TTu
28 | P a g e
FLOW GRAPH
omm
3
cco
4
a.
5
iy 6
un
7
slsD
8 12
9
aial
13
orri
10 11
14
utot
17
15 16
TTu
29 | P a g e
CALCULATING CYCLOMETIC COMPLEXITY
P=4
E = 20
N = 17
R=5
omm
WHERE P = NO OF PREDICATE NODES
E = NO. OF EDGES
N = NO. OF NODES
cco
R = NO. OF REGIONS
a.
= 20-17+2
OR
=5
iy
un
CYCLOMATIC COMPLEXITY = P+1
= 4+1
slsD
=5
OR
CYCLOMATIC COMPLEXITY = R
aial
=5
orri
utot
TTu
30 | P a g e
6 References
https://www.tutorialsduniya.com
Software Engineering: A Practitioner’s Approach by Roger S. Pressman
omm
An Integrated Approach to Software Engineering by P. Jalote
https://www.tutorialsduniya.com
cco
a.
iy
un
slsD
aial
orri
utot
TTu
31 | P a g e