Airline System Project

AIR AIR LINES RESERVATION SYSTEM
Enrollment No. Page 1
A Project Report On
AIR LINES RESERVATION SYSTEM
SUBMITTED BY:
CERTIFICATE
This is to certify that the project work entitled Air Lines Reservation System, which is being submitted by Enrollment no!
in partial fulfillment of the requirements for award of the degree of "#A$NE%& (Bachelor of cience in !nformation Technology" in is an authentic work carried out by the student in .. under my super#isor and guidance$
! wish the student the best for his academic #entures$
Signature of Student
Signature of Supervisor: Name of Supervisor: . Date:
ACKNOWLEDGEMENT
In this modern world of competition there is a race of existence in which those are efficient to come forward to succeed. Project is like a bridge between theoretical and practical .so, I have joined this particular project. oda! after completing m! project I feel great relief and satisfaction, now when I look back, I still remember the da! when I was assigned this project AIRLINES RESERVATION . I was somewhat pu""led and a bit nervous and curious where to begin from. his was a new exposure for me. #t this juncture of time when m! project is completed, I would like to that who provided me power to complete this work and to m! parents who alwa!s inspired and encouraged me throughout m! life. $nce again, I would like to conve! m! sincere and special thanks to %r. fa!u"t# of &omputer 'cience, for his kind cooperation and knowledge assistance in giving shape to this project and great regards for all the &ollage staff members who gave me the practical knowledge of all. I believe that without their guidance the successful completion of this project was not possible.
Enrollment No. Page (
Signature of Student
Date:
Enrollment No. Page )
TABLE OF CONTENTS
CERTIFICATE..............................................................................................................................3 ACKNOWLEDGEMENT...............................................................................................................4 TABLE OF CONTENTS...............................................................................................................6 INTRODUCTION..........................................................................................................................7 OBJECTIVES.................................................................................................................................8 SYSTEM ANALYSIS...................................................................................................................10 SYSTEM ANALYSIS...................................................................................................................11 FEASIBILITY STUDY................................................................................................................13 1.Te !"# $% Fe$&#'#%#()*................................................................................................................14 +LATFORM USED......................................................................................................................18 +ROJECT ANALYSIS.................................................................................................................1, RISK ANALYSIS..........................................................................................................................-. OJBECT ORIENTED DEVELO+MENT...................................................................................-6 WORK FLOW T/E +ROJECT...................................................................................................-7 FEASIBILITY STUDY................................................................................................................-8 TY+E OF FEASIBILITIES.........................................................................................................-, SYSTEM DESIGN.......................................................................................................................3+ROJECT DESIGN.....................................................................................................................3, TABLE STRUCTURE..................................................................................................................44 1. CUSTOMER.DAT 0S(12e& $%% #"3124$(#1" 312 5&(14e2&6.....................................................44 -. STATION.DAT 0S(12e& $%% #"3124$(#1" 312 S($(#1"&6.............................................................44 +ROGRAM STRUCTURE...........................................................................................................4. FLOW C/ART.............................................................................................................................47 DFD...............................................................................................................................................60 D$($ F%17 D#$82$4......................................................................................................................64 +ROJECT CODE 9 AIRLINE RESERVATION SYSTEM.......................................................67 SOFTWARE TESTING : IM+LIMENTATION*.....................................................................,8 V$%#;$(#1" (e&(#"8* .....................................................................................................................100 AL+/A TESTING* ...................................................................................................................100 IM+LEMENTATION................................................................................................................103 SYSTEM SECURITY MEASURES..........................................................................................10. +ERT !$2( $"; GANTT !$2(.................................................................................................106 FUTURE SCO+E OF T/E +ROJECT....................................................................................108 REFERENCES...........................................................................................................................10,
Enrollment No. Page *
INTRODUCTION
Project name is Air Lines Reservation System.
The project is very flexible and it can be modified if the need arises. I hope the user will find this project work quite pleasing in its output as general sample designing has been done to enhance the view and simple programming statement and commands have been made use of, so that the user had no problem in understanding the listing of the project. iles have been used to create a systematic medium of data storage and retrieval. I am sure that reader will like this effort and so, I wished him!her by hearts to ahead and turn this page.
Enrollment No. Page +
OBJECTIVES
#irwa!s has a number of reservation offices in each cit! where the flights operate. ,ach reservation office has a number of reservation counters to handle reservations and cancellations. ,ach counter has a counter assistant who is responsible for making he main objective of this project to performed reservations or cancellations. reservation, cancellation and report. In concerned to reservations, the following activities are done. #ccepts the date, sector, and class of travel from the person and checks for the availabilit! of a seat in the Reservation file. &onfirms the details with the prospective passenger and accepts the remaining details. -pdate the seat availabilit! status in the reservation file and adds the passenger details to the file. 1P/02 number, &ollects the fare amount. -pdate the Daily Collection file with the fare amount. In concerned to cancellation, the following activities is done 0etrieves the details from the file using the P/0 number. 3erifies the details of the ticket and computes the refund amount. -pdates the seat availabilit! status in the reservations file and marks the corresponding details of the file. %akes the refund and prints the refund receipt. 4iles the receipt along with the signature of the passenger . -pdates the Daily Collection file.
he passenger is assigned a uni.ue Passenger /ame 0e.uest
#nd 0eports are generated as67 Print the confirmed and wait7listed passenger list of flights departing . Print the dail! collection summar! report. It also generate view rates for different sector 8 view flight schedules for a specific period 'how status of ticket with given P/0 number. 0eport on availabilit! of flight 8 seats on desired date.
SYSTEM ANALYSIS
SYSTEM ANALYSIS
!ntroduction of %ser &efinition of ystem !dentification of 'eed (reliminary !n#estigation )odules in *!+,-!'E +E E+.*T!/' 0 TE)
Enrollment No. Page 1:
S$STE% ANAL$SIS
#nal!sis is a detailed stud! of the various operations performed b! a s!stem and their relation within and outside the s!stem. # ke! .uestion is what must be done to solve the problem. $ne aspect of the anal!sis defining the boundaries of the s!stem and determining whether or not a candidate s!stem should consider other related s!stem. ;uring anal!sis data are collected on the available files decision points and transaction handled b! the parent s!stem. 'ome logical s!stem models and tools are used in the anal!sis. ;ata flow diagrams, interviews, onsite observation and .uestionnaires are examples, the interview is commonl! used in anal!sis. It re.uires special skill and sensitivit! to the subject being interview bias in data collection and interpretation can be problem. raining experience and common sense are re.uired for &ollections of the information are needed to do anal!sis. $nce anal!sis is completed, the anal!st has firm understanding of what is to be done. he next step is to decide how the problem might be solved. hus in s!stem design, we be move from the logical to the ph!sical aspects of the life c!cle.
T&e Initia" Investigation and Identifi!ation of need :

he most critical phase of managing s!stem projects is planning to launch a s!stem investigation, we need plan detailing the steps to be taken, the people to be .uestioned and the! out come expected. he initial investigation has the objective of determining whether the users re.uest has potential merit. he major steps are defining user re.uirements. <hen the initial investigation is completed. he user receives a proposal summari"ing the finding the recommendation of the anal!st. # ke! part of feasibilit! anal!sis is gathering information about the present s!stem. he anal!st knows what information to gather, where to find it, how to collect it and what
to make of it. he proper use of tools for gathering information is the ke! to successful anal!sis. he tools are the traditional interview, .uestionnaire, and on7site observation. <e need to know, for example how to structure an interview, what makes up a .uestionnaire, and what to look for on7site observations. hese tools when learned help anal!sis assess the effectiveness of the present s!stem and provide the groundwork for recommending a candidate s!stem.
Identifi!ation of need
he s!stem need accomplish the following functions6 he s!stem should allow the counter assistants to handle ticketing and refunds.
<hile accepting reservation data, all necessar! validations should be performed. 4or example, the s!stem should check whether a flight operates on the date of travel specified b! the passenger. It should also check the seat availabilit! status. #fter all data has accepted, the s!stem should print the ticket. It should also store the passenger details, update the dail! collections, and update the seat plan. In case of cancellation, the s!stem should accept the P/0 number from the user, validate the P/0 number and update the cancellation flag for the passenger. he s!stem should then print the refund receipt. It should also update the dail! collections to reflect the refund amount. he status of overbooked and wait7listed tickets should be changed whenever a confirmed ticket is cancelled. he s!stem should generate the following reports6 1. &onfirmed passenger list 2. <aiting list 3. ;ail! collection report In addition, the new s!stem should provide facilitate passengers to perform the following tasks6
&heck the waiting list status. 3iew rates for different sectors. 3iew flight schedules for a specific period. his module should be developed as an affiliate program that can be easil! integrated with various <eb sites.
FEASIBILITY STUDY
he main objective of the preliminar! anal!sis is to identif! the problem, evaluate the s!stem concept of feasibilit!, and perform the economic and technical anal!ses perform the cost benefit anal!sis. #fter the clarification anal!sis the solution proposed it is checked that it is practical to implement that solution. his is done through the feasibilit! stud!. It is checked for various aspects whether the proposed solution is technicall! or economicall! feasible or not. $n the basis if which it has been categori"ed into four classes vi" '.( Te!&ni!a" ).( E!onomi! *.( Operationa" he outcome of the preliminar! anal!sis should be clear so that an alternate wa! to do the job can be found out= 1.Techn ca! Fea" # ! t$: ;uring the technical feasibilit! studies following issues are taken into consideration 1. <hether the re.uired technolog! is available or not= 2. 0e.uired resources are available or not= 1%anpower, programmer, software and hardware etc2 $nce the technical feasibilit! is established, it is important to consider the monetar! factors also. 'ince it might happen that developing a particular s!stem ma! be technicall! possible but it ma! be re.uire huge investments and benefits ma! be less. 4or evaluating this, economic feasibilit! of the proposed s!stem is carried out. #s in our proposed s!stem our team has technicall! trained manpower with knowledge of developing the s!stem. <e are going to use web technolog! in our s!stem, which is readil! available. 'oftware to be used is also available easil!. 'o technicall! the project is feasible.
). E!onomi! +easi,i"it#:
Enrollment No. Page 1(
4or an! s!stem if the expected benefits e.ual or exceed the expected costs, the s!stem can be judged to be economicall! feasible. In economic feasibilit!, cost benefit anal!sis is done in which expected costs and benefits are evaluated. ,conomic anal!sis is used for evaluating the effectiveness of the proposed s!stem. In economic feasibilit!, the most important is cost benefit anal!sis. #s the name suggests, it is an anal!sis of the cost to be incurred in the s!stem and benefits derivable out of the s!stem. #s in our institute the hardware and software re.uired for this t!pe of s!stem is alread! available so economicall! our project is feasible. *. Operationa" +easi,i"it# he staff of the compan! 1client2 is used to the computer. he! will onl! be given training about the proposed s!stem to make efficient use of it. his feasibilit! stud! is carried out b! a small group of people who are familiar with information s!stem techni.ues, who understand the part of the s!stem that are relevant to the project and are skilled in s!stem anal!sis and design process. &onsidering the above three feasibilit! we can sa! that the s!stem is feasible and ahead for anal!sis of the s!stem.
"# T$%&' '()I(''&I() P%&%*I"+
Enrollment No. Page 1)
In the software principle we are using the incremental model 1evolutionar! software process model2. he incremental model combines elements of the linear se.uential model with the iterative philosoph! of protot!ping. he linear se.uential model suggests a s!stemic, se.uential approach to software development that begins at the s!stem level #/#>?'I'6 In this phase we will gathered all the information about the organi"ation the users. ;,'I@/6 #fter anal!sis we documented all the Interface representations, and algorithm details. &$;I/@ #/; %$;->, ,' I/@6 #fter designing, coding pla!s major role in software development process. <e are using A#3#1A'P2 in front end, $0#&>, in the back end for coding Individual modules developed in this phase is also tested before being delivered to the program testing phase. P0$@0#% ,' I/@6 $nce the module has been developed. Program testing begins <e will provide some other users for testing for few da!s, and all problems and errors, which overcome during testing, will be pointed out. he user re.uirement will be also kept in mind and then deliver! process begins. ;,>I3,0?6 $nce the s!stem passes all the tests, it is delivered to the customer and enters the maintenance phase.
and progress through anal!sis, design,
coding and module testing, deliver! and maintenance. .ueries and
anal!sis re.uirement for both the s!stem and software documented and reviewed with
Enrollment No. Page 1*
%#I/ ,/#/&,6 'oftware will undoubtedl! undergo changes because errors have been encountered. 'o keeping re.uirement and testing in mind, we will make some necessar! changes.
Enrollment No. Page 1+
%LATFORM USED -ard.are Re/uirement
'. 0entium 0ro!essor or a,ove ). 1o"or %onitor *. 2e#,oard 3. 4 56 -ard Dis7 or a,ove 8. *) %6 RA% or a,ove 9. '.33 %6 +"opp# Dis7 Drive :. Spea7ers
Software Requirement '. ). *. ;indo.s <= or %S>DOS 9.)) Tur,o 1?? 1ompi"er Tur,o 1?? Editor or an# ot&er te=t editor
%ROJECT ANALYSIS
1$$P' B $bject $riented Programming '!stem2 $bject $riented Programming is a method of programming that seeks to mimic the wa! we form models of the world. o cope with the complexities of life, we have evolved a wonderful capacit! to generali"e, classif! and generate abstractions. #lmost ever! noun in our vocabular! represents a class of objects sharing some set of attributes or behavioral traits. he entire basis of $bject $riented Programming, infect is defining the $bject in $bject $riented Programming. $bject is a unit that combines both code and data together. #nd an object is an instance of a class. &lass is a t!pe of data structure defined to hold both data and the code functions. $bject $riented Programming also allows !ou to design and implement !our application more .uickl! than traditional approaches. $bject $riented Programming also makes code easier to maintain so that !ou can refine the implementation without causing major problems. 'ince object7oriented programming was fundamental to the development of &CC, it is important to define precisel! what object7oriented programming is. $bject7oriented programming has taken the best ideas of structured programming and has combined them with several powerful concepts that allow !ou to organi"e !our programs more effectivel!. In general, when programming in an object7oriented fashion, !ou decompose a problem into its constituent parts. ,ach component becomes a self7contained object that contains its own instructions and data related to that object. hrough this process, complexit! is reduced and !ou can manage larger programs.
Encaps'(ation
#s !ou probabl! know, all programs are composed of two fundamental elements6 program statements 1code2 and data. &ode is that part of a program that performs actions, and data is the information affected b! those actions. ,ncapsulation is a programming mechanism that binds together code and the data it manipulates, and that keeps both safe from outside interference and misuse. In an object7oriented language, code and data ma! be bound together in such a wa! that a self7contained black box is created. <ithin the box are all necessar! data and code. <hen code and data are linked together in this fashion, an object is created. In other words, an object is the device that supports encapsulation. <ithin an object, the code, data, or both ma! be private to that object or public. Private code or data is known to, and accessible onl! b!, another part of the object. hat is, private code or data ma! not be accessed b! a piece of the program that exists outside the object. <hen code or data is public, other parts of !our program ma! access it, even though it is defined within an object. !picall!, the public parts of an object are used to provide a controlled interface to the private elements of the object.
Po(ymorp)ism
Pol!morphism 1from the @reek, meaning Dman! formsE2 is the .ualit! that allows one interface to be used for a general class of actions. he specific action is determined b! the exact nature of the situation. # simple example of pol!morphism is found in the
'teering wheel of an automobile. he steering wheel 1i.e., the interface2 is the same no matter what t!pe of actual steering mechanism is used. hat is, the steering wheel works the same whether !our car has manual steering, power steering, or rack7and7pinion steering. herefore, once !ou know how to operate the steering wheel, !ou can drive an! t!pe of car. consider a stack 1which is a first7in, last7out list2. ?ou might have a program that re.uires three different t!pes of stacks. $ne stack is used for integer values, one for floating7point values, and one for characters. In this case, the algorithm that implements each stack is the same, even though the data being stored differs. In a non7object7oriented language, !ou would be re.uired to create three different sets of stack routines, calling each set b! a different name, with each set having its own interface. Fowever, because of pol!morphism, in &CC !ou can create one general set of stack routines 1one interface2 that works for all three specific situations. his wa!, once !ou know how to use one stack, !ou can use them all. %ore generall!, the concept of pol!morphism is often expressed b! the phrase Done interface, multiple methods.E his means that it is possible to design a generic interface to a group of related activities. Pol!morphism helps reduce complexit! b! allowing the same interface to be used to specif! a general class of action. It is the compilerGs job to select the specific action 1i.e., method2 as it applies to each situation. ?ou, the programmer, donGt need to do this selection manuall!. ?ou need onl! remember and utili"e the general interface.
he same principle can also appl! to programming. 4or example,
he first object7oriented programming languages were interpreters, so pol!morphism was, of course, supported at run time. Fowever, &CC is a compiled language. herefore, in &CC, both run7time and compile7time pol!morphism are supported.
In)eritance
Inheritance is the process b! which one object can ac.uire the properties of another object. he reason this is important is that it supports the concept of hierarchical classification. If !ou think about it, most knowledge is made manageable b! hierarchical 1i.e., top7down2 classifications. 4or example, a 0ed ;elicious apple is part of the classification apple, which in turn is part of the fruit class, which is under the larger class food. hat is, the food class possesses certain .ualities 1edible, nutritious, etc.2 that also appl!, logicall!, to its fruit subclass. In addition to these .ualities, the fruit class has specific characteristics 1juic!, sweet, etc.2 that distinguish it from other food. he apple class defines those .ualities specific to an apple 1grows on trees, not tropical, etc.2. # 0ed ;elicious apple would, in turn, inherit all the .ualities of all preceding classes, and would define onl! those .ualities that make it uni.ue. <ithout the use of hierarchies, each object would have to explicitl! define all of its characteristics. Fowever, using inheritance, an object needs to define onl! those .ualities that make it uni.ue within its class. It can inherit its general attributes from its parent. hus, it is the inheritance mechanism that makes it possible for one object to be a specific instance of a more general case.
#** Imp(ements OOP

#s !ou will see as !ou progress through this book, man! of the features of &CC exist to provide support for encapsulation, pol!morphism, and inheritance. 0emember, however, that !ou can use &CC to write an! t!pe of program, using an! t!pe of approach. he fact that &CC supports object7oriented programming does not mean that !ou can onl! write object7oriented programs. #s with its predecessor, &, one of &CCGs strongest advantages is its flexibilit!.
RISK ANALYSIS
Project Risk: It identify potential udgetary! sc"edule! personnel! resource!
customer! and re#uirements pro lems and t"eir impact on soft$are. All t"e a ove factors are analy%ed! customer re#uirements are analy%ed properly.
&ec"nical
Risk:
It
identifies
potential
design!
implementation!
interface! een
verification! and maintenance pro lems. All t"e a ove factors "ave analy%ed.
'usiness Risk: ()* Soft$are is developed keeping in mind t"at t"ere is demand in custom! so t"at to avoid t"e market risk. (+* Soft$are is designed to fit into t"e overall usiness strategy for t"e custom department! to avoid t"e y t"e sales
strategic risk. (,* &"e soft$are is easily understanda le
person-s team! so t"at t"ey could kno$ muc" a out t"e product $orking and sell in t"e market. (.* It "as t"e strong management support! and not likely to c"ange in t"e management people to avoid t"e management risk. (/* Soft$are fits t"e udget and t"ere is no udget risk.
OJBECT ORIENTED DEVELO%MENT

#n object7oriented s!stem draws upon class definitions that are derived from the anal!sis model. 'ome of these definitions will have to be built from scratch, but man! others ma! be reused it appropriate design patterns are recogni"ed. $bject $riented ;esign establishes a design blueprint that enables a software engineer to define the $bject $riented architecture in a manner that maximi"ed reuse, thereb! improving development speed and end7product .ualit!. T&e four "a#ers of t&e O,@e!t Oriented design are: he subs!stem la!er6 It represents each of the subs!stems that enable the software to achieve its customer7defined re.uirements and to implement the technical infrastructure that supports customer re.uirements, in the custom department. he class and object la!er6 It contains the class hierarchies that enable the s!stem to be created using generali"ations and increasingl! more targeted speciali"ations. he message la!er6 It contains the design details that enable each object to communicate with its collaborators. his la!er establishes the external and inters interfaces for the software. he responsibilities la!er6 It contains the data structure and algorithmic design for all attributes and operations for each object.
WORK FLOW T&E %ROJECT

-ser can view list of stations along with their code, charges for document and non7document b! selecting option 1 from the main menu. -ser can book the courier b! selecting option 2 from the main menu. -sers have to input details of courier, consignor and consignee, and data is saved in the file B customer. at. -ser can search for station information b! giving station code, b! selecting option 3 from the main menu. -ser can search and view customer details b! selecting option ( from the main menu. -ser can view dail! booking status b! selecting option 1 from the report menu. -ser can view monthl! booking status b! selecting option 2 from the report menu. -ser can add, modif! or delete station records b! selecting option 1, 2 or 3 from the edit station menu.
FEASIBILITY STUDY
Steps in feasi,i"it# ana"#sis
Eig&t steps are invo"ved in t&e feasi,i"it# ana"#sis. T&e# are :
1. F124 $ <21=e ( (e$4 $"; $<<1#"( $ <21=e ( %e$;e2. -. +2e<$2e &)&(e4 3%17 !$2(&. 3. E"54e2$(e <1(e"(#$% <21<1&e; &)&(e4&. 4. De3#"e $"; #;e"(#3) !$2$ (e2#&(# & 13 <21<1&e; &)&(e4. .. De(e24#"e $"; e>$%5$(e <e23124$" e $"; <21<1&e; &)&(e4. 6. We#8!( &)&(e4 <e23124$" e $"; 1&( ;$($. 7. Se%e ( (!e 'e&( <21<1&e; &)&(e4. 8. +2e<$2e $"; 2e<12( 3#"$% <21=e ( ;#2e (#>e (1 4$"$8e4e"( 1&( e33e (#>e"e&& 13 e$ !
TY%E OF FEASIBILITIES
'. E!onomi! +easi,i"it#
E!onomi! ana"#sis is t&e most fre/uent"# used te!&ni/ue for eva"uating t&e effe!tiveness of a proposed s#stem. %ore !ommon"# 7no.n as !ost A ,enefit ana"#sisB in t&is pro!edure .e determine t&e ,enefits and savings t&at are e=pe!ted from a proposed s#stem and !ompare t&em .it& !osts. ;e found t&e ,enefits out.eig& t&e !ostsB .e ta7e a de!ision to design and imp"ement t&e ne. proposed s#stem.
). Te!&ni!a" +easi,i"it#
T&is is !on!erned .it& spe!if#ing e/uipment and soft.are t&at .i"" su!!essfu""# satisf# t&e user re/uirement. T&e te!&ni!a" needs of t&e s#stem ma# var# !onsidera,"#C ,ut mig&t in!"ude: D T&e fa!i"it# to produ!e outputs in a given time.
D Response time under !ertain !onditions. D A,i"it# to pro!ess a !ertain vo"ume of transa!tion at a parti!u"ar speed. D +a!i"it# to !ommuni!ate data to distant "o!ation.
After e=amining te!&ni!a" feasi,i"it#C .e give more importan!e to t&e !onfiguration of t&e s#stem t&an t&e a!tua" ma7e of &ard.are. T&e !onfiguration gives t&e !omp"ete pi!ture a,out t&e s#stemEs re/uirements: Ten to t.e"ve .or7stations are re/uiredC t&ese units s&ou"d ,e inter!onne!ted t&roug& LAN so t&at t&e# !ou"d operate and !ommuni!ate smoot&"#. T&e# s&ou"d &ave enoug& speeds of input and output to a!&ieve a parti!u"ar /ua"it# of printing.
*. Operationa" +easi,i"it#
It is main"# re"ated to &uman organiFationa" and po"iti!a" aspe!ts. T&e points to ,e !onsidered are: D .&at !&anges .i"" ,e ,roug&t .it& t&e s#stemG D .&at organiFationa" stru!tures are distur,edG
D .&at ne. s7i""s .i"" ,e re/uiredG Do t&e e=isting staff mem,ers &ave t&ese s7i""sG
D If notC !an t&e# ,e trained in due !ourse of timeG 5enera""# pro@e!t .i"" not ,e re@e!ted simp"# ,e!ause of operationa" infeasi,i"it# ,ut su!& !onsiderations are "i7e"# to !riti!a""# affe!t t&e nature and s!ope of t&e eventua" re!ommendations. +or operationa" feasi,i"it# stud# .e appointed a sma"" group of peop"e .&o are fami"iar .it& information s#stem te!&ni/uesC .&o understand t&e parts of t&e ,usiness t&at are re"evant to t&e pro@e!t and are s7i""ed in s#stem ana"#sis and design pro!ess.
4. S1 #$% 3e$&#'#%#()
So!ia" feasi,i"it# is a determination of .&et&er a proposed pro@e!t .i"" ,e a!!epta,"e to t&e peop"e or not. T&is determination t#pi!a""# e=amines t&e pro,a,i"it# of t&e pro@e!t ,eing a!!epted ,# t&e group dire!t"# affe!ted ,# t&e proposed s#stem !&ange.
.. M$"$8e4e"( 3e$&#'#%#()
It is a determination of .&et&er a proposed pro@e!t .i"" ,e a!!epta,"e to management. If management does not a!!ept a pro@e!t or gives a neg"igi,"e support to itC t&e ana"#st .i"" tend to vie. t&e pro@e!t as a non>feasi,"e one.
9. Lega" feasi,i"it#
Lega" feasi,i"it# is a determination of .&et&er a proposed pro@e!t infringes on 7no.n A!tsC StatutesC as .e"" as an# pending "egis"ation. A"t&oug& in some instan!es t&e pro@e!t mig&t appear soundC on !"oser investigation it ma# ,e found to infringe on severa" "ega" areas.
:. Time feasi,i"it#
Time feasi,i"it# is a determination of .&et&er a proposed pro@e!t !an ,e imp"emented fu""# .it&in a stipu"ated time frame. If a pro@e!t ta7es too mu!& time it is "i7e"# to ,e re@e!ted.
SYSTEM DESIGN
Introduction
'!stem design provides the understandings and procedural details necessar! for implementing the s!stem recommended in the s!stem stud!. ,mphasis is on the translating the performance re.uirements into design specifications. he design has is a transition from a user7oriented document 1'!stem proposal2 to a document oriented to the programmers or database personnel. '!stem design goes through two phases of development6 12 22 >ogical ;esign Ph!sical ;esign
# data flow diagram shows the logical flow of the s!stem. 4or a s!stem it describes the input 1source2, output 1destination2, 4I>, 1data stores2 and procedures 1data flows2 all in a format that meets the userGs re.uirement. <hen anal!sis prepare the logical s!stem design, the! specif! the user needs at a level of detail that virtuall! determines the information flow into an out of the s!stem and the re.uired data resources. he logical design also specifies input forms and screen la!outs. he activities following logical design are the procedure followed in the ph!sical design e.g., producing programs, software, file and a working s!stem. ;esign specifications instruct the user about what the s!stem should do.
Logi!a" and Output Design: he logical design of an information s!stem is analogous to an engineering blue print of an automobile. It shows the major features and how the! are related to one another. he detailed specification for the new s!stem was drawn on the bases of userGs re.uirement data. he outputs inputs and databases are designed in this phase.
$utput design is one of the most important features of the information s!stem. <hen the output is not of good .ualit! the users will be averse to use the newl! designed s!stem and ma! not use the s!stem. here are man! t!pes of output, all of which can be either highl! useful or can be critical to the users, depending on the manner and degree to which the! are used. $utputs from computer s!stem are re.uired primaril! to communicate the results of processing to usersH the! are also used to provide a permanent hard cop! of these results for later consultation. 3arious t!pes of outputs re.uired can be listed as below6 ,xternal $utputs, whose destination is outside the organi"ation Internal outputs, whose destination is with the organi"ation $perational outputs, whose use is purel! with in the computer department e.g., program7listing etc. Interactive outputs, which involve the user is communicating directl! with the computer, It is particularl! important to consider human factor when designing computer outputs. ,nd user must find outputs eas! to use and useful to their jobs, without .ualit! output, user ma! find the entire s!stem unnecessar! and avoid using it. he term D$utputE in an! information s!stem ma! appl! to either printer or displa!ed information. ;uring the designing the output for this s!stem, it was taken into consideration, whether the information to be presented in the form of .uer! of report or to create documents etc. $ther important factors that were taken into consideration are6 he ,nd user, who will use the output. he actual usage of the planned information
he information that is necessar! for presentation <hen and how often output and their format is needed. <hile designing output for project based #ttendance &ompilation '!stem, the following aspects of outputs designing were taken into consideration.
he outputs 1i.e., well formatted table outputs in the screen itself2 designed are simple to read and interpret.
4ormat of each output was another important point taken into consideration. $utput media, for each output appropriate media is decided whether it will be displa!ed on screen or will be taken to printer or both.
$ther output design related specifications, i.e., how fre.uentl! the outputs will be generated, how man! pages or sheets approximatel! it will keep up, what is its planned use and output distribution to users are also taken into account. hese were a few major designing issues, which were taken into consideration,
while deciding the output specifications for the s!stem. #s direct beneficiar! of reports is the user communit!, the! were consulted constantl! at ever! level. 4ormats and screen design for various reports were identified, taking into account the user re.uirements. Iefore finalising these were given to users for an! improvement and suggestions. ,nd users issues taken into consideration were 0eadabilit!, 0elevance and #cceptabilit!. $nce all the output reports to be generated b! F#0' s!stem were identified, the! were given to users for their acceptance. 4or protot!ping various outputs, final outputs models were created with dumm! data, before the! were finali"ed.
Output Sour!es:
$utput contents originate from these sources6 0etrieval from a data source. ransmission from a process or s!stem activit!. ;irectl! from an input source.
The information produced in an output can be presented as abular contents @raphic format -sing Icons
$utput ;efinition6 he output should be defined in terms of6 !pes of outputs ;ata items &ontent7headings, numeric, alphanumeric, etc., 4ormat7hardcop!, screen, microfilm, etc., >ocation7local, remote, transmitted, etc., 4re.uenc!7dail!, weekl!, hourl!, etc., 0esponse7immediate with in a period, etc.,
he name given to each data item should be recorded and its characteristics described clearl! in a standard form6 <hether alphanumeric or numeric >egitimate and specific range of characteristics /umber of characters Positions of decimal point, arithmetic design, etc.,
Input Design: he input design is the link that ties the information s!stem into the userGs world. Input specifications describe the manner in which data enters the s!stem for processing. Input design features can ensure the reliabilit! of the s!stem and produce results from accurate data, or the! can result in the production of erroneous information.
Input ;esign consists of developing specifications and procedures for data preparation 'teps necessar! to put data into a usable form for processing. ;ata entr!, the activit! of putting data into the computer processing.
O,@e!tives of Input design
Five objectives of design input focus on &ontrolling the amount of input re.uired #void dela! #voiding errors in data #voiding extra steps. Jeeping the process simple.
Input stages several activities have to be carried out as part of the overall input process. he! include some or all of the following.
;ata recording 1i.e., collection of data2 ;ata encapsulation 1i.e., transfer of data2 ;ata conversion 1i., e.controlling the flow of data2 ;ata transmission 1i.e., transporting the data2 ;ata validation 1i.e., checking the input data2 ;ata correction 1i.e., correcting the errors2 Input Performa were designed, after a careful discussion with users. It was attempted to cover all user re.uirements. ;esigned Performa were given to user for an! suggestion and final approval. 3arious data items were identified and wherever necessar! were recorded. #s the data concerning of F#0' is voluminous in nature and number of case will grow d!namicall! in future, proper care was taken for accurac! and consistenc! of data.
Input designs are aimed at reducing the chances of mistakes of errors. #s the human beings are prone to errors there is alwa!s a possibilit! of occurrence of chance of errors. #de.uate validation checks are incorporated to ensure error free data storage. 'ome of the data validation checks applied are as following6 0edundanc! of data is checked. It means the records of primar! ke! do not occur twice. Primar! ke! field of an! table must not be left blank. <herever items are coded, input code is checked for itGs validl! with respect to several checks. -tmost care has been taken to incorporate the validation at each stage of the s!stem. ,.g. when entering records into emplo!ee information table for emplo!ee, it is checked that whether the corresponding emplo!ee exists in the emplo!ee information table etc.,
,nough messages and dialogue boxes are provided while design screen, which does guide user at the time of an! errors, or at time of entr!. his feature provides a user7friendl! interface to native users. It can be emphasi"ed that input deigns of F#0' s!stem is so designed that it ensures eas! and error free data entr! mechanism. $nce one is sure of input data the output formatting becomes a routine work.
%ROJECT DESIGN
%odu"es H 0ro!ess "ogi!

#irwa!s has a number of reservation offices in each cit! where the flights operate. ,ach reservation office has a number of reservation counters to handle reservations and cancellations. ,ach counter has a counter assistant who is responsible for making he procedure followed for performing reservations and reservations or cancellations. cancellations is given bellow. Reservation 0eservations for a flight commence 3: da!s before the date of the flight. for making reservations is given below. provisional reservations the can be made through telephone conversation. $n receiving re.uest for reservation from a person, the counter assistant performs the following activities6 #ccepts the date, sector, and class of travel from the person and checks for the availabilit! of a seat on the re.uested date. he details about the availabilit! seats and the seat plan are kept in the Reservation file. &onfirms the details with the prospective passenger and accepts the remaining details. hese details include the preferences such as a window or an aisle seat, a smoking or a non7smoking "one, meal preferences such as vegetarian or non7 vegetarian, and special service re.uests 1''02, such as dietar! and medical considerations. -pdate the seat availabilit! status in the reservation file and adds the passenger details to the file. he passenger is assigned a uni.ue Passenger /ame 0e.uest 1P/02 number, which is used to access ticket details for .ueries and cancellation. &ollects the fare amount. Prints the ticket and gives it to the passenger. -pdate the Daily Collection file with the fare amount. he procedure he procedure described below deals with the
Enrollment No. Page (:
Fori"on #irwa!s also provides for overbooked and wait7listed tickets for the econom! class. $verbooking is allowed for 1: seats per flight. 4or example, if the capacit! of an aircraft is 3(: seats, booking are made for 3): seats, that is, 3(: seats C 1: overbooked tickets. If the number of bookings exceeds the capacit! and overbooking, a wait7listed ticket is issued to the passenger with his or her consent. #n overbooked or wait7listed passenger is accommodated on the flight depending on the availabilit! of a seat when the passenger checks in. # passenger who cannot be accommodated on a flight is given full refund.
&ancellation
$n receiving a cancellation re.uest from a passenger the counter assistant performs the following tasks6 0etrieves the details from the file using the P/0 number. 3erifies the details of the ticket and computes the refund amount. -pdates the seat availabilit! status in the reservations file and marks the corresponding details of the file. %akes the refund and prints the refund receipt. 4iles the receipt along with the signature of the passenger. -pdates the Daily Collection file. he amount of refund is calculated based on the ticket status and the date cancellation. If the ticket is wait7listed or overbooked, full amount is refunded.
3 %$&&e& !$>e 'ee" 5&e; #" (!#& <21=e (:
' # I$/ ;# ,
Enrollment No. Page (1
&-' $%,0
%odu"es in !"ass STATION: addition12 modification12 deletion12 list12 search12 amount12 6 6 6 6 6 6 4unction to add new station record in the file. 4unction to modif! existing record of station. 4unction to delete existing record of the station. 4unction to displa! list of all stations. 4unction to search information for station. 4unction to calculate and return total amount for the given information of found code12 6 station. 4unction to return station code found in the file or not. %odu"es in !"ass DATE: valid12 6 4unction to check validit! of the given date.
%odu"es in !"ass 1ISTO%ER: booking12 6 4unction to book courier along with consignor and consignee information and search12 dail! list12 monthl! list12 lastcustcode12 6 6 6 6 store in the file B customer. at. 4unction to search for the customer information. 4unction to displa! dail! booking status. 4unction to displa! monthl! booking status. 4unction to return last customer code in the customer file.
TABLE STRUCTURE
Two files have been used in this project:
1. CUSTOMER.DAT 'St()e" a!! n*()+at (n *() c,"t(+e)" custcode /ame #ddress Phone 'trode 6 6 6 6 6 6 6 6 6 6 6 6 &ode no. of the customer. his is uni.ue field. /ame of the customer. #ddress of the customer. Phone no. of the customer. 'tation code to which courier has to be sends. &onsignee name. &onsignee address. &onsignee phone no. !pe of the courier 1document or non7 document2 <eight of the courier. otal charges for sending the courier. ;ate of booking courier.
&ame &adress &phone !pe <eight #mount ;oI
.. STATION.DAT 'St()e" a!! *() Stat (n" strode 6 &ode no. of the station.
n*()+at (n
Enrollment No. Page ((
/ame ;oc ;ocadd /doc ndocadd
6 6 6 6 6
/ame of the station. &harges for document. #dditional charges for document above ):: gms. &harges for non7document. #dditional charges for non7document above ):: gms.
%ROGRAM STRUCTURE
3 classes have been used in this project: ' # I$/ ;# , &-' $%,0 %odu"es in !"ass STATION:
Enrollment No. Page ()
addition12 modification12 deletion12 list12 search12 amount12
6 6 6 6 6 6
4unction to add new station record in the file. 4unction to modif! existing record of station. 4unction to delete existing record of the station. 4unction to displa! list of all stations. 4unction to search information for station. 4unction to calculate and return total amount for the given information of station. 4unction to return station code found in the file or not.
foundcode12
%odu"es in !"ass DATE: valid12 6 4unction to check validit! of the given date.
%odu"es in !"ass 1ISTO%ER: booking12 6 4unction to book courier along with consinor and consinee information and search12 6 store in the file B customer.dat. 4unction to search for the customer information.
Enrollment No. Page (*
dail!list12 %onthl!list12 lastcustcode12
6 6 6
4unction to displa! dail! booking status. 4unction to displa! monthl! booking status. 4unction to return last customer code in the customer file.
FLOW C&ART
Enrollment No. Page (+
' #0
1. 'tation Information 2. Iooking 3. 'earch 'tation (. &ustomer 0ecord ). 0eports *. ,dit 'tation :. Kuit ,nter !our &hoice 6
%,/-
Input &h
If &hL1 / If &hL2 If &hL* &hL: / If / &hL3 &hL) /
2
' $P *
? ?
3 ) (
If &hL(
$pen file station.dat in read onl! mode.
0ead data from file and ;ispla! station information.
if eof
%,/-
switch to next record
Input consinor, consinee and courier information.
$pen file customer.dat in append mode.
Enrollment No. Page ):
write data in file.
%,/-
3 Input code no. of the station
$pen file station.dat in read onl! mode.
0ead data from file.
if eof /
%,/-
if stcode L file.stcode
/
Enrollment No. Page )1
? ;ispla! station information.
switch to next record
Input code no. of the customer
$pen file customer.dat in read onl! mode.
if eof / if code L file.code
? %,/-
? ;ispla! customer information.
switch to next record )
1. ;ail! Iooking 'tatus 2. %onthl! Iooking 'tatus :. ,xit ,nter !our &hoice 6 Input &h
If &hL1 / If &hL2 / If &hL:
01
02
? %,/-
01
Input ;ate to view status
if eof
if date L booking date
/
Enrollment No. Page )(
;ispla! booking information.
02 switch to next record Input month 8 !ear to view status
if eof
if month L booking month
Enrollment No. Page ))
? ;ispla! booking information.
* to next record switch
1. #dd new station record 2. ;elete 0ecord 3. %odif! 0ecord :. ,xit ,nter !our &hoice 6 Input &h
If &hL1 / If &hL2 / If &hL3 /
,1
,2
,3
Enrollment No. Page )*
If &hL:
%,/-
,1
Input station information.
$pen file station.dat in append mode.
write data in file.
Enrollment No. Page )+
,2
Input code no. of the station
$pen master file station.dat in read mode. $pen transaction file in write mode
0ead all the records from master file and write in transaction file accept the record to be deleted.
$pen master file station.dat in write mode. $pen transaction file in read mode
0ead all the records from transaction file and write in master file.
* ,3
Input code no. of the station
$pen master file station.dat in read mode. $pen transaction file in write mode
0ead all the records from master file and write in transaction file with updation.
$pen master file station.dat in write mode. $pen transaction file in read mode
DFD
Enrollment No. Page *:
ENTIT$ RELATIONS-I0 DIA5RA% JERD(:

he overall logical structure of a database can be express graphicall! b! an ,707;iagram. hen relative simplicit! and pictorial clarit! of this diagramming
techni.ue ma! well '!stem in large part for the wide spread use of the ,70 model. 7.1.1 14<1"e"(& 13 E?R D#$82$4* Re ($"8%e6 which represent entit! sets
E%%#<&e&6 which represent attributes
D#$41";&6 which represent relationships sets
L#"e&6 which link attribute to entit! set and entit! set to relationship sets
D15'%e e%%#<&e&6 which represent multi values attributes
D$&!e; e%%#<&e&6 which denote derived attributes
Entit#>Re"ations&ip Diagram
Enrollment No. Page *1
he following diagram depicts various entities involved in the airline reservation s!stem the attributes of entities and the relationships between entities6
'eat Mone '' 0 'tatu s #ircraft !pe &ancel 4lag 4light /o. 4irst &lass 'eats available
%eal
'eat preference
;ep. ime #rr. ime
&lass
P#'',/@,0
Ioar ds
4>I@F 1
4light ;ate
ravel ;ate
Iusiness &lass 'eats

#ge 4irst /ame >ast /ame $perates in P/0 /o. ,conom! &lass 'eats available
#vailable
1 'ector I; ;escription
4irst &lass 4are
Iusiness &lass 4are
',& $0
<eek ;a! 2
<eek ;a! 1
,conom! &lass 4are
he Entit#>Re"ations&ip Diagram for the #irlines 0eservation '!stem
DATA+LO; DIA5RA% JD+D(:

4ull descriptions of the s!stem actuall! consist of a set of data flow diagram. S<e #3# $(#1"*
Fere we have used YOURDONGs data flow s!mbols. D$($3%176 ;ata move in a specific direction from and origin to a destination the form of a document.
+21 e&&* People, procedures or device that use or produced data. he ph!sical component is not identified.
S152 e 12 ;e&(#"$(#1"* ,xternal source or destinations of data interact with the s!stem. he terms source and sink are interchangeable with
origin and destination.
D$($ &(12e* Fere data are store or referenced b! a process in the s!stem.
Data F!(/ D a0)a+
&heck waiting 'tatus 0eservationN&ancellation 0e.ues #sk availabilit! of seat, 4are 8 schedule
Kuer! waiting list 8 ;ail! -pdate available seatNamount
&ustomer
0esponse availabilit! of seat, 4are 8 schedule 0eservationN &ancellation response <aiting status
#irwa!s 0eservatio n '!stem
4eed complete detail
&ounter #ssistant
@enerate P/0 /o.
icket Print 0esponse waiting list 8 ;ail!
1ONTEKT LEVEL D+D
Enrollment No. Page *(
Enrollment No. Page *)
%)(0)a+ c(1 n0
Enrollment No. Page **
%ROJECT CODE 2 AIRLINE RESERVATION SYSTEM

# # # # # # # # # include include include include include include include include include <iostream.h> <fstream.h> <string.h> <stdlib.h> <stdio.h> <ctype.h> <dos.h> <conio.h> <process.h>
class TICKET pri!ate" !oid #$$%&EC'&$(char)*+,-char)*.,-char)*.,-int-int/0 public" !oid #$$ITI'N(!oid/0 !oid EN12I&3(!oid/0 char 456I78TN'(int/0 protected" char fltno)*+,-from)*.,-to)*.,0 int ecofair-e9efair0 :0 ;;T8I< C6#<< C'NT&'6< #66 T8E 52NCTI'N< &E6#TE$ T' P#<<EN7E&< class P#<<EN7E& public" !oid #$$%&EC'&$(int-int-char)=>,-char)?>,-int-char-char/0 !oid $E6ETE%TICKET(int/0 int $E6ETE%56I78T(int/0 !oid 6I<T(!oid/0 int 6#<T%TICKETN'(!oid/0 int <E#T<(int/0
Enrollment No. Page *+
int 5'2N$(int/0 char 4N#@E(int/0 !oid P#<<%IN5'(/0 !oid @'$I53(/0 protected" char Class-name)=>,-address)?>,-se90 int slno-age-ticAetno0 :0 ;;T8I< I< T8E $E&IBE$ C6#<< C8IC8 C'NT&'6< #66 T8E 52NCTI'N< ;;&E6#TE$ T' &E<E&B#TI'N-C#NCE66#TI'N-ETC. class &E<E&BE " public TICKET-public P#<<EN7E& public" !oid !oid !oid !oid :0 ;;52NCTI'N T' #$$ 7IBEN $#T# IN T8E TICKET 5I6E(TICKET.$#T/ !oid TICKET "" #$$%&EC'&$(char t%fltno)*+,-char t%from)*.,-char t%to)*.,-int t%ecofair-int t%e9efair/ fstream file0 file.open(DTICKET.$#TD-ios""app/0 strcpy(fltno-t%fltno/0 strcpy(from-t%from/0 strcpy(to-t%to/0 ecofair E t%ecofair0 e9efair E t%e9efair0 file.Frite((char4/this-siGeof(TICKET//0 file.close(/0 : ;;52NCTI'N T' &ET2&N 56I78T N'. 5'& T8E 7IBEN <.N' char 4TICKET "" 56I78TN'(int sno/ fstream file0 file.open(DTICKET.$#TD-ios""in/0 int count E *0 Fhile(file.read((char4/ this-siGeof(TICKET///
&E<E&B#TI'N(!oid/0 C#NCE66#TI'N(!oid/0 $I<P6#3%TICKET(!oid/0 $E6ETE%#66(!oid/0
if (sno EE count/ breaA0 countHH0 : file.close(/0 return fltno0 : ;;52NCTI'N T' 7IBE $#T# T' #$$ &EC'&$< IN T8E TICKET 5I6E !oid TICKET "" #$$ITI'N(!oid/ fstream file0 file.open(DTICKET.$#TD-ios""in/0 if (Ifile.fail(/ / return0 file.close(/0 #$$%&EC'&$(DK6*J>D-D$E68ID-D@2@K#ID-*.++-*J++/0 #$$%&EC'&$(DK6*JJD-D@2@K#ID-D$E68ID-*.++-*J++/0 #$$%&EC'&$(DK6*.>D-D$E68ID-DC#6C2TT#D-*J++-*L++/0 #$$%&EC'&$(DK6*.JD-DC#6C2TT#D-D$E68ID-*J++-*L++/0 #$$%&EC'&$(DK6*>>D-D$E68ID-D@#$&#<D-=*++-=?++/0 #$$%&EC'&$(DK6*>JD-D@#$&#<D-D$E68ID-=*++-=?++/0 #$$%&EC'&$(DK6*J>D-D@2@K#ID-DC#6C2TT#D-*L++-=*++/0 #$$%&EC'&$(DK6*JJD-DC#6C2TT#D-D@2@K#ID-*L++-=*++/0 #$$%&EC'&$(DK6*M>D-D@2@K#ID-D@#$&#<D-*M++-=+++/0 #$$%&EC'&$(DK6*MJD-D@#$&#<D-D@2@K#ID-*M++-=+++/0 #$$%&EC'&$(DK6*L>D-DC#6C2TT#D-D@#$&#<D-*>++-*M++/0 #$$%&EC'&$(DK6*LJD-D@#$&#<D-DC#6C2TT#D-*>++-*M++/0 : ;;52NCTI'N T' $I<P6#3 6I<T '5 56I78T< !oid TICKET "" EN12I&3(!oid/ clrscr(/0 fstream file0 file.open(DTICKET.$#TD-ios""in/0 goto9y(?+-?/0 cout<<D6I<T '5 T8E 56I78T<D0 goto9y(*M-./0 cout<<D<no. 56I78T N'. 5&'@ T' ENE.5#I&D0 int roF E J-sno E *0 Fhile(file.read((char4/this- siGeof(TICKET///
EC'.5#I&
goto9y(*M-roF/0 cout<<sno0 goto9y(=?-roF/0 cout<<fltno0 goto9y(?O-roF/0 cout<<from0 goto9y(OO-roF/0 cout<<to0 goto9y(.?-roF/0 cout<<ecofair0 goto9y(>?-roF/0 cout<<e9efair0 roFHH0 snoHH0 : file.close(/0 : ;;52NCTI'N T' &E<E&BE TICKET 5'& T8E P#<<EN7E&< !oid &E<E&BE "" &E<E&B#TI'N(!oid/ clrscr(/0 EN12I&3(/0 char t*)*.,-pclass-pname)=>,-paddress)?>,-pse9-pfltno)*+,0 int t=-!alid-page-tno-sno0 P#<<EN7E& p0 tno E p.6#<T%TICKETN'(/ H *0 do !alid E *0 goto9y(?-=?/0 clreol(/0 cout<<DP&E<< <ENTE&> T' ENITD0 goto9y(?-=+/0 clreol(/0 cout<<DENTE& T8E <N'. '5 T8E 56I78T " D0 gets(t*/0 t= E atoi(t*/0 sno E t=0 if(strlen(t*/ EE +/ return0 if(sno < * PP sno > *=/ !alid E +0
Enrollment No. Page +:
goto9y(?-=?/0 clreol(/0 cout<<DENTE& C'&&ECT63D0 getch(/0 : : Fhile(I!alid/0 int iE*0 fstream file0 file.open(DTICKET.$#TD-ios""in/0 Fhile(file.read((char4/this- siGeof(TICKET/// if(sno EE i/ breaA0 iHH0 : file.close(/0 strcpy(pfltno-fltno/0 if(p.<E#T<(sno/>E=.+/ goto9y(.-=*/0 cout<<DQJ<orryI <E#T< #&E N'T #B#I6#K6ED0 getch(/0 return0 : goto9y(?-=?/0 clreol(/0 cout<<DEEEC'N'@IC-NEENEC2TIBE or P&E<< <ENTE&> T' ENITD0 do goto9y(?-=*/0 clreol(/0 cout<<DK3 C8IC8 C6#<< 3'2 C'26$ 6IKE T' T&#BE6 " D0 pclass E getche(/0 pclass E toupper(pclass/0 if(pclass EE *?/ return0 : Fhile(pclass IERER SS pclass IERNR/0 clrscr(/0 goto9y(J=-?/0 cout<<D<+>TENITD0 goto9y(?O-=/0
Enrollment No. Page +1
cout<<D&E<E&B#TI'ND0 goto9y(.-./0 cout<<DN#@E " D0 goto9y(.->/0 cout<<D#$$&E<< " D0 goto9y(.-J/0 cout<<D<EN @;5 " D0 goto9y(.-M/0 cout<<D#7E " D0 do !alid E *0 goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E N#@E '5 T8E P#<<EN7E&D0 goto9y(*.-./0 clreol(/0 gets(pname/0 if(pname)+, EE R+R/ return0 if(strlen(pname/ < * PP strlen(pname/ > =./ !alid E +0 goto9y(.-=./0 clreol(/0 cout<<DQJENTE& C'&&ECT63 getch(/0 : : do !alid E *0 goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E #$$&E<< '5 T8E P#<<EN7E&D0 goto9y(*.->/0 clreol(/0 gets(paddress/0 if(paddress)+, EE R+R/ return0 if(strlen(paddress/ < * PP strlen(paddress/ > ?./ !alid E +0 goto9y(.-=./0 clreol(/0
&#N7E " * T' =.:D0
Fhile(I!alid/0
cout<<DQJENTE& C'&&ECT63 getch(/0 : : do Fhile(I!alid/0
&#N7E " * T' ?.:D0
goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E <EN '5 T8E P#<<EN7E&D0 goto9y(*.-J/0 clreol(/0 pse9 E getche(/0 pse9 E toupper(pse9/0 if(pse9 EE R+R/ return0 : Fhile(pse9 IER@R SS pse9 IER5R /0 do !alid E *0 goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E #7E '5 T8E P#<<EN7E&D0 goto9y(*.-M/0 clreol(/0 gets(t*/0 t= E atoi(t*/0 page E t=0 if(t*)+, EE R+R/ return0 if(page < * PP page > *++/ !alid E +0 goto9y(.-=./0 clreol(/0 cout<<DQJENTE& C'&&ECT63 D0 getch(/0 : : Fhile(I!alid/0 clrscr(/0 goto9y(**-O/0 cout<<D4444444444444444444444444444444444444444444444444444D0 goto9y(**-=*/0
cout<<D4444444444444444444444444444444444444444444444444444D0 goto9y(??->/0 cout<<DTICKET N'. " D<<tno0 goto9y(*J-L/0 cout<<from<<D T' D<<to0 goto9y(O.-L/0 cout<<D56I78T N'. " D<<pfltno0 goto9y(=+-**/0 cout<<DP#<<EN7E& N#@E " D<<pname0 goto9y(=+-*?/0 cout<<D#$$&E<< " D<<paddress0 goto9y(=+-*./0 cout<<D<EN " D<<pse90 goto9y(=+-*J/0 cout<<D#7E " D<<page0 goto9y(O.-*L/0 if(pclass EE RER/ cout<<DT'T#6 5#I& " D<<ecofair0 else cout<<DT'T#6 5#I& " D<<e9efair0 p.#$$%&EC'&$(tno-sno-pname-paddress-page-pse9-pclass/0 getch(/0 : ;; 52NCTI'N T' #$$ T8E 7IBEN $#T# IN T8E P#<<EN7E&R< 5I6E !oid P#<<EN7E& "" #$$%&EC'&$ (int tno-int sno-char pname)=>,-char paddress)?>,-int page-char pse9-char pclass/ fstream file0 file.open(DP#<<.$#TD-ios""app/0 ticAetno E tno0 slno E sno0 strcpy(name-pname/0 strcpy(address-paddress/0 age E page0 se9 E pse90 Class E pclass0 file.Frite((char4/this-siGeof(P#<<EN7E&//0 file.close(/0 : !oid P#<<EN7E& "" @'$I53(/ int tcno0
Enrollment No. Page +(
char t*)*.,-pclass-pname)=>,-paddress)?>,-pse9-pfltno)*+,0 int t=-!alid-page-tno-sno0 P#<<%IN5'(/0 cout<<DQnENTE& T8E TICKET N2@KE& '5 T8E P#<<EN7E&D0 cin>>tcno0 fstream file0 file.open(DP#<<.$#TD-ios""inPios""out/0 int mE+0 int l0 file.read((char4/this-siGeof(P#<<EN7E&//0 Fhile(Ifile.eof(// mHH0 if(tcnoEEticAetno/ lE(mT*/4siGeof(P#<<EN7E&/0 cout<<l0 getch(/0 clrscr(/0 goto9y(J=-?/0 cout<<D<+>TENITD0 goto9y(?O-=/0 cout<<D&E<E&B#TI'ND0 goto9y(.-./0 cout<<DN#@E " D0 goto9y(.->/0 cout<<D#$$&E<< " D0 goto9y(.-J/0 cout<<D<EN @;5 " D0 goto9y(.-M/0 cout<<D#7E " D0 goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E N#@E '5 T8E P#<<EN7E&D0 goto9y(*.-./0 clreol(/0 gets(pname/0 goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E #$$&E<< '5 T8E P#<<EN7E&D0 goto9y(*.->/0 clreol(/0 gets(paddress/0 goto9y(.-=./0
Enrollment No. Page +)
clreol(/0 cout<<DENTE& T8E <EN '5 T8E P#<<EN7E&D0 goto9y(*.-J/0 clreol(/0 pse9 E getche(/0 pse9 E toupper(pse9/0 goto9y(.-=./0 clreol(/0 cout<<DENTE& T8E #7E '5 T8E P#<<EN7E&D0 goto9y(*.-M/0 clreol(/0 gets(t*/0 t= E atoi(t*/0 page E t=0 cout<<DC6#<<"E(EC'N'@IC/ '& N(ENEC2TIBE/D0 pclassEgetche(/0 if(strlen(paddress/IE+/ strcpy(address-paddress/0 if(strlen(pname/IE+/ strcpy(name-pname/0 if(strlen(t*/IE+/ ageEpage0 if(pse9IE*?/ se9Epse90 if(pclassIE*?/ ClassEpclass0 file.seeAp(l/0 file.Frite((char4/this-siGeof(P#<<EN7E&//0 file.close(/0 return0 : else file.read((char4/this-siGeof(P#<<EN7E&//0 : : !oid P#<<EN7E& "" P#<<%IN5'(/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 cout<<D IN5'&@#TI'NQnD0 cout<<D 44444444444444444444444444QnD0 goto9y(=-O/0 P#<<EN7E&<
Enrollment No. Page +*
cout<<DT.N'.D0 goto9y(**-O/0 cout<<D<.N'.D0 goto9y(=.-O/0 cout<<DN#@ED0 goto9y(OM-O/0 cout<<D#$$&E<<D0 goto9y(>>-O/0 cout<<D#7ED0 goto9y(J+-O/0 cout<<D<END0 goto9y(JO-O/0 cout<<DC6#<<D0 goto9y(*-./0 cout<<D444444444444444444444444444444444444444444444444444444444 4444444444444444444444D0 int tno-sno-page0 char pname)=>,-paddress)?>,-pse9-pclass-pfltno)*+,0 int iE>0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// tnoEticAetno0 snoEslno0 strcpy(pname-name/0 strcpy(paddress-address/0 page E age0 pse9 E se90 pclass E Class0 goto9y(=-i/0 cout<<tno0 goto9y(**-i/0 cout<<sno0 goto9y(=+-i/0 cout<<pname0 goto9y(O.-i/0 cout<<paddress0 goto9y(>J-i/0 cout<<page0 goto9y(J*-i/0 cout<<pse90 goto9y(JJ-i/0 cout<<pclass0 iHH0 : file.close(/0 :
Enrollment No. Page ++
;;T8I< 52NCTI'N &ET2&N< T8E 6#<T TICKET N'. IN T8E P#<<EN7E& 5I6E int P#<<EN7E& ""6#<T%TICKETN'(!oid/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 int count E +0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// count E ticAetno0 file.close(/0 return count0 : ;;T8I< 52NCTI'N &ET2&N< T'T#6 N'. '5 <E#T< IN T8E P#<<EN7E& 5I6E int P#<<EN7E& "" <E#T<(int sno/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 int count E +0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// if(sno EE slno/ countHH0 : file.close(/0 return count0 : ;;T8I< 52NCTI'N &ET2&N< + I5 T8E TICKET N'. I< N'T 5'2N$ IN T8E ;;P#<<EN7E& 5I6E int P#<<EN7E& "" 5'2N$(int tno/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 int found E +0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// if(tno EE ticAetno/ found E *0 breaA0
: : file.close(/0 return found0 : ;;T8I< 52NCTI'N &ET2&N< P#<<EN7E&R< N#@E 5'& T8E 7IBEN TICKETN'. char 4P#<<EN7E& "" N#@E(int tno/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// if(tno EE ticAetno/ breaA0 : file.close(/0 return name0 : ;;T8I< 52NCTI'N $I<P6#3< T8E 6I<T '5 T8E P#<<EN7E&< !oid P#<<EN7E& "" 6I<T (!oid/ clrscr(/0 char t*)*+,0 int t=-sno-!alid0 TICKET ticAet0 ticAet.EN12I&3(/0 do !alid E *0 goto9y(?-=?/0 clreol(/0 cout<<DP&E<< <ENTE&> T' ENITD0 goto9y(?-=+/0 clreol(/0 cout<<DENTE& <N'.'5 T8E 56I78T C8'<E $ET#I6< 3'2 C#NTD0 gets(t*/0 t= E atoi(t*/0 sno E t=0 if(strlen(t*/ EE +/ return0 if(sno < * PP sno > *=/
!alid E +0 goto9y(?-=?/0 clreol(/0 cout<<DQJENTE& C'&&ECT63D0 getch(/0 : Fhile(I!alid/0
clrscr(/0 int roF E M-found E +-flag E +0 char ch0 goto9y(?-O/0 cout<<D56I78T N'.TTTT> D<<ticAet.56I78TN'(sno/0 goto9y(=M-=/0 cout<<D446I<T '5 P#<<EN7E&<44D0 goto9y(.->/0 cout<<DTICKET N'. N#@E C6#<< D0 goto9y(O-J/0 cout<<D4444444444444444444444444444444444444444444444444444444D0 fstream file0 file.open(DP#<<.$#TD-ios""in/0 file.seeAg(+-ios""beg/0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// if(sno EE slno/ flag E +0 delay(=+/0 found E *0 goto9y(.-roF/0 cout<<ticAetno0 goto9y(*J-roF/0 cout<<name0 goto9y(OL-roF/0 if(Class EE RNR/ cout<<DENEC2TIBED0 else cout<<DEC'N'@ICD0 if(roF EE =*/ flag E *0 roF E J0 goto9y(.-=?/0 cout<<DP&E<< #N3 KE3 T' C'NTIN2E '& P&E<< <E<C>D0
ch E getch(/0 if(ch EE =J/ breaA0 clrscr(/0 goto9y(?=-?/0 cout<<D6I<T '5 P#<<EN7E&<D0 goto9y(=-./0 cout<<DTICKET N'. N#@E : else roFHH0 : : if(Ifound/ goto9y(.-*+/0 cout<<DQJ&EC'&$< N'T 5'2N$D0 : if(Iflag/ goto9y(.-=?/0 cout<<DP&E<< #N3 KE3 T' C'NTIN2E....D0 getch(/0 : file.close(/0 :
C6#<< D0
;;T8I< 52NCTI'N $E6ETE< P#<<EN7E& &EC'&$< 5'& T8E 7IBEN TICKET N'. !oid P#<<EN7E& "" $E6ETE%TICKET(int tno/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 fstream temp0 temp.open(Dtemp.datD-ios""out/0 file.seeAg(+-ios""beg/0 Fhile(Ifile.eof(// file.read((char4/this-siGeof(P#<<EN7E&//0 if(file.eof(// breaA0 if(tno IE ticAetno/ temp.Frite((char4/this-siGeof(P#<<EN7E&//0 : file.close(/0 temp.close(/0
file.open(DP#<<.$#TD-ios""out/0 temp.open(Dtemp.datD-ios""in/0 temp.seeAg(+-ios""beg/0 Fhile(Itemp.eof(/ / temp.read((char4/this-siGeof(P#<<EN7E&//0 if(temp.eof(/ / breaA0 file.Frite((char4/this-siGeof(P#<<EN7E&//0 : file.close(/0 temp.close(/0 : ;;T8I< 52NCTI'N $E6ETE< P#<<EN7E& &EC'&$< 5'& T8E 7IBEN 56I78TN'. int P#<<EN7E& "" $E6ETE%56I78T(int sno/ fstream file0 file.open(DP#<<.$#TD-ios""in/0 fstream temp0 temp.open(Dtemp.datD-ios""out/0 file.seeAg(+-ios""beg/0 int found E +0 Fhile(Ifile.eof(/ / file.read((char4/this-siGeof(P#<<EN7E&//0 if(file.eof(/ / breaA0 if(sno IEslno/ temp.Frite((char4/this-siGeof(P#<<EN7E&//0 else found E *0 : file.close(/0 temp.close(/0 file.open(DP#<<.$#TD-ios""out/0 temp.open(Dtemp.datD-ios""in/0 temp.seeAg(+-ios""beg/0 Fhile(Itemp.eof(/ / temp.read((char4/this-siGeof(P#<<EN7E&//0 if(temp.eof(/ / breaA0 file.Frite((char4/this-siGeof(P#<<EN7E&//0 :
file.close(/0 temp.close(/0 return found0 : ;;T8I< 52NCTI'N C#NCE6< P#<<EN7E&R< TICKET !oid &E<E&BE ""C#NCE66#TI'N(!oid/ clrscr(/0 char t*)*+,-ch0 int t=-tno-!alid0 do !alid E *0 goto9y(?-=?/0 clreol(/0 cout<<DP&E<< <ENTE&> T' <EE 6I<T '& + T' ENIT D0 goto9y(?-=+/0 clreol(/0 cout<<DENTE& TICKETN'. '5 P#<<EN7E& T' C#NCE6 T8E TICKETD0 gets(t*/0 t= E atoi(t*/0 tno E t=0 if(t*)+, EE R+R/ return0 if(strlen(t*/ EE +/ !alid E +0 6I<T(/0 clrscr(/0 : if(I5'2N$(tno/ SS !alid/ !alid E +0 goto9y(?-=?/0 clreol(/0 cout<<DQJ&EC'&$ N'T 5'2N$D0 getch(/0 : : Fhile(I!alid/0
;;P#7E ** clrscr(/0
fstream file0 file.open(DP#<<.$#TD-ios""in/0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// if(ticAetno EE tno/ breaA0 file.close(/0 int i E *0 file.open(DTICKET.$#TD-ios""in/0 Fhile(file.read((char4/this-siGeof(TICKET/// if(slno EE i/ breaA0 iHH0 : file.close(/0 P#<<EN7E& p0 goto9y(**-O/0 cout<<D4444444444444444444444444444444444444444444444444444D0 goto9y(**-=*/0 cout<<D4444444444444444444444444444444444444444444444444444D0 goto9y(??->/0 cout<<DTICKET N'. " D<<tno0 goto9y(*J-L/0 cout<<from<<D T' D<<to0 goto9y(O.-L/0 cout<<D56I78T N'. " D<<fltno0 goto9y(=+-**/0 cout<<DP#<<EN7E& N#@E " D<<p.N#@E(tno/0 goto9y(=+-*?/0 cout<<D#$$&E<< " D<<address0 goto9y(=+-*./0 cout<<D<EN " D<<se90 goto9y(=+-*J/0 cout<<D#7E " D<<age0 goto9y(O.-*L/0 if(Class EE RER/ cout<<DT'T#6 5#I& " D<<ecofair0 else cout<<DT'T#6 5#I& " D<<e9efair0 do goto9y(*+-=?/0 clreol(/0 cout<<DC#NCE6 T8I< TICKET (3;N/ " D0 ch E getch(/0
ch E toupper(ch/0 Fhile(ch IE R3R SS ch IE RNR/0
if(ch EE RNR/ return0 $E6ETE%TICKET(tno/0 goto9y(*+-=./0 cout<<DQJTICKET C#NCE66E$D0 getch(/0 : ;;T8I< 52NCTI'N $I<P6#3< T8E P#<<EN7E&R< IN5'&@#TI'N !oid &E<E&BE "" $I<P6#3%TICKET(!oid/ ;; P#7E *=
clrscr(/0 char t*)*+,-ch0 int t=-tno-!alid0 do !alid E *0 goto9y(?-=?/0 clreol(/0 cout<<DP&E<< <ENTE&> T' <EE 6I<T '& + T' ENITD0 goto9y(?-=+/0 clreol(/0 cout<<DENTE& T8E TICKETN'. '5 T8E P#<<EN7E& " D0 gets(t*/0 t= E atoi(t*/0 tno E t=0 if(t*)+, EE R+R/ return0 if(strlen(t*/ EE +/ !alid E +0 6I<T(/0 clrscr(/0 : if(5'2N$(tno/ SS !alid/ !alid E +0 goto9y(?-=?/0 clreol(/0 cout<<DQJ&EC'&$ N'T 5'2N$D0
getch(/0 : : Fhile(I!alid/0 clrscr(/0 fstream file0 file.open(DP#<<.$#TD-ios""in/0 Fhile(file.read((char4/this-siGeof(P#<<EN7E&/// if(ticAetno EE tno/ breaA0 file.close(/0 int i E *0 file.open(DTICKET.$#TD-ios""in/0 Fhile(file.read((char4/this-siGeof(TICKET/// if(slno EE i/ breaA0 iHH0 : file.close(/0 P#<<EN7E& p0 goto9y(**-O/0 cout<<D4444444444444444444444444444444444444444444444444444D0 goto9y(**-=*/0 cout<<D4444444444444444444444444444444444444444444444444444D0 goto9y(??->/0 cout<<DTICKET N'. " D<<tno0 goto9y(*J-L/0 cout<<from<<D T' D<<to0 goto9y(O.-L/0 cout<<D56I78T N'. " D<<fltno0 goto9y(=+-**/0 cout<<DP#<<EN7E& N#@E " D<<p.N#@E(tno/0 goto9y(=+-*?/0 cout<<D#$$&E<< " D<<address0 ;; P#7E *?
goto9y(=+-*./0 cout<<D<EN " D<<se90 goto9y(=+-*J/0 cout<<D#7E " D<<age0 goto9y(O.-*L/0 if(Class EE RER/
cout<<DT'T#6 5#I& " D<<ecofair0 else cout<<DT'T#6 5#I& " D<<e9efair0 goto9y(*+-=./0 cout<<DP&E<< #N3 KE3 T' C'NTIN2E....D0 getch(/0 : ;;T8I< 52NCTI'N 7IBE< 56I78T N'. T' $E6ETE #66 P#<<EN7E& &EC'&$< !oid &E<E&BE "" $E6ETE%#66(!oid/ clrscr(/0 EN12I&3(/0 char t*).,0 int t=-!alid-sno0 do !alid E *0 goto9y(?-=?/0 clreol(/0 cout<<DP&E<< <ENTE&> T' ENITD0 goto9y(?-=+/0 cout<<DENTE& <N'. '5 T8E 56I78T T' $E6ETE &E6#TE$ &EC'&$<D0 gets(t*/0 t= E atoi(t*/0 sno E t=0 if(strlen(t*/ EE +/ return0 if(sno < * PP sno > *=/ !alid E +0 goto9y(?-=?/0 clreol(/0 cout<<DQJENTE& C'&&ECT63D0 getch(/0 : : Fhile(I!alid/0 goto9y(?-=?/0 if(I$E6ETE%56I78T(sno/ / cout<<DQJ&EC'&$< N'T 5'2N$.P&E<< #N3 KE3 T' C'NTIN2E....D0 else
cout<<DQJ&EC'&$< $E6ETE$.P&E<< #N3 KE3 T' C'NTIN2E....D0 getch(/0 : ;;T8I< I< T8E @#IN 52NCTI'N C8IC8 $I<P6#3< @EN2 #N$ C#66< 52NCTI'N< !oid main(!oid/ ;; P#7E *O P#<<EN7E& p0 TICKET ticAet0 &E<E&BE r0 ticAet.#$$ITI'N(/0 int ch-ch*0 Fhile(*/ clrscr(/0 goto9y(=L-L/0 cout<<D#I& TICKET &E<E&B#TI'ND0 goto9y(=L-*+/0 cout<<DUUUUUUUUUUUUUUUUUUUUUUUUUUD0 goto9y(?+-**/0 cout<<D* " &E<E&B#TI'ND0 goto9y(?+-*=/0 cout<<D= " C#NCE66#TI'ND0 goto9y(?+-*?/0 cout<<D? " P#<<EN7E& &EC'&$< T>D0 goto9y(?+-*O/0 cout<<DO " EN12I&3D0 goto9y(?+-*./0 cout<<D. " 6I<T '5 P#<<EN7E&<D0 goto9y(?+-*>/0 cout<<D> " 12ITD0 goto9y(?+-*M/0 cout<<DENTE& 3'2& C8'ICE " D0 cin>>ch0 sFitch(ch/ case *" r.&E<E&B#TI'N(/0 breaA0 case ="
r.C#NCE66#TI'N(/0 breaA0 case ?" clrscr(/0 goto9y(=L-*+/0 cout<<D P#<<EN7E& &EC'&$< D0 goto9y(=L-**/0 cout<<DUUUUUUUUUUUUUUUUUUUUUUUD0 goto9y(??-*=/0 cout<<D* " P#<<EN7E& IN5'&@#TI'ND0 goto9y(??-*?/0 cout<<D= " @'$I53D0 goto9y(??-*O/0 cout<<D+ " ENITD0 goto9y(??-*>/0 cout<<DENTE& 3'2& C8'ICETTT>D0 cin>>ch*0 if(ch*EE*/ clrscr(/0 p.P#<<%IN5'(/0 getch(/0 : else if(ch*EE=/ clrscr(/0 p.@'$I53(/0: else breaA0 breaA0 case O" ticAet.EN12I&3(/0 goto9y(=-=?/0 cout<<DP&E<< #N3 KE3 T' C'NTIN2E....D0 getch(/0 breaA0 case ." p.6I<T(/0 breaA0 case >" e9it(+/0 default" cout<<DENTE& T8E C'&&ECT C8'ICED0 :
: :
OUT%UT SCREEN
LOGIN %AGE OF AIRLINES TICKET RESERVATION
NO. OF FLIG&TS
LIS& 01 &23 1LI42&S
PASS3543R R360R7S
LIS& 01 &23 1LI42&S
PASS3543RS I510R8A&I05
SOFTWARE TESTING 3 IM%LIMENTATION:

SO+T;ARE TESTIN5:
he purpose of this document is to cover testing of Fori"on #irwa!s project from all aspects i.e. from module wide testing to s!stem integration testing . 'oftware testing is a process of executing a program with objective of finding an error. 'oftware .ualit! should be a primar! concern in software development efforts. 'oftware testing and evaluation are traditional method of checking software .ualit!. It consists of putting together various coded pieces of a design, testing them and correcting the parts of the code or the design that is not correct. #t this stage some errors are introduced purposel! to test whether the program will spot them. est summar! document with test results 1Kualit! 0ecord2 for each test case with problems found during the test execution. #fter review of test summar! document, it will be decided if an! test case is to be repeated or if the identified problem should be converted into Da defectE to be fixed in subse.uent release of product. Data entr#: Is alphanumeric data entr! properl! echoed and input to the s!stem= ;o graphical modes of data entr! work properl!= Is invalid data properl! recogni"ed= #re data input messages intelligible= TESTIN5 STRATE5IES: # strateg! for software testing ma! also be viewed in the context of spiral. -nit testing begins at the vertex of the spiral and concentrates on each unit of the software as implemented in source code. esting progresses the moving outward along the spiral to integrations testing. <here the focus is on design and the and the construction of the software architecture. aking another turn outward on the spiral, we encounter validation testing, where re.uirements established as part of software re.uirements anal!sis are
validated against the software that has been constructed. 4inall!, arrive at s!stem testing, where the software and other s!stem elements are tested as a whole. Fere I will specif! each testing but the outcome of the testing and reports is not included because the! are ver! large and I have to give Project7 0eport in limited page. Init testing: In -nit testing module interface, local data structures. Ioundar! conditions, independent paths, error handling paths are tested. %odule interface is tested to ensure that information properl! flows into and our of the program unit under test. he local data is structure is examined to ensure that data stored temporaril! maintained its integrit! during all steps in an algorithmGs execution. Ioundar! conditions are tested to ensure that the module operates properl! at boundaries established to limit or restrict processing. #ll independent paths through the control structure are exercised to ensure that all statements in a module have been executed at lest once. #nd finall!, all error handling paths are tested. hus the unit testing is done after code development, reviewed, and verified for correct s!ntax and in unit testing we execute each module one b! one and prepare a report of result. Integration te!&ni/ue: Integration testing is a s!stematic techni.ue for constructing the program structure while conducting tests to uncover errors associated with interfacing. he objective is to take unit tested modules and build a program structure that has been dictated b! design. heir are three t!pe of integration testing, each are discussed below.
$P ;$</ I/ ,@,0# I$/6 his techni.ue is an approach to construction of program structure. %odules are integrated b! moving downward through the control hierarch!, beginning with the main
control module. %odules subordinate to the main control module are incorporated into the structure either into a depth7first or breadth first manner. I used depth7search for testing which integrate all modules on a major control path of structure. 6OTTO% O+ INTE5ERATION: his techni.ue begins construction and testing with atomic modules. Iecause modules are integrated from the bottom up, processing re.uired for module subordinate to a given levelGs alwa!s available and the need for stubs are eliminated. RE5RESSION TESTIN5: his techni.ue is the activit! that help to ensure that changes during the testing do not introduce unintended behavior or additional errors. Va! 1at (n te"t n0: 3alidation succeeds when software functions in a manner that can be reasonabl! expected b! the customer. here are two t!pes of validation testing these are discussed below. AL%&A TESTING: he alpha tests are conducted at the developerGs site b! a customer. he software is used in a natural setting with the developer. #lpha tests are conducted in a controlled environment. 6ETA TESTIN5: he beta tests are conducted at one or more customer sites b! the end use of the software. -nlike, the alpha testing, the developer is generall! not present. herefore, the beta test is a DliveE application of the software in an environment that cannot be controlled b! the developer. he customer records all problems that are encountered during beta testing he software developer makes modifications and then prepares for
and reports these to the developer at regular intervals. #s a results of problems reported during beta test. release of the software product to the entire customer base.
Enrollment No. Page 1::
S#stem testing: It is a series of different test whose primar! purpose is to full! exercise the computer7 based s!stem. hese are discussed below6 0,&$3,0? ,' I/@6 It the s!stem tests that forces the software to fail in a variet! of wa!s and verifies that recover! is properl! performed. ',&-0I ? ,' I/@6 It attempts to verif! that protection mechanisms built into a s!stem will in fact protect, it from improper penetration. ' 0,'' ,' I/@6 It executes a s!stem in a manner that demands resources in abnormal .uantit!, 4re.uenc!, or volume. P,04$0%#/&, ,' I/@6 It is designed to test run7time performance of software within the context of an integrated s!stem. It occurs throughout all steps in the testing process.
@-I 3erification 4ield >evel 3alidation &3S&I54 83&2070L04I3S @lobal >evel 3alidation @-I esting &onsistenc! of @-Is esting 'tandard &ontrols esting 'trateg! 'tressN>oad esting Profile esting ;atabase 'cript esting 4ail7over esting
&ompatibilit! esting Performance esting Page 1:1

Enrollment No.
4unctional esting 'cenario Iased esting /egative esting
Enrollment No. Page 1:2
IM%LEMENTATION
I%0LE%ENTATION 0LAN:
Implementation follows the forms to the detailed design stage. his effect of the user department and s!stem designer in getting the new steps in operation. he following steps are performed during implementation6 12 '!stem esting6 It is tested and ensured that the different modules are working correctl! individuall! and as a whole. 22 0eview and %aintenance6 $nce the s!stem becomes operational, it would be examined to see if it has met its objective. he s!stem is reviewed and maintained periodicall! for the following reasons6 o deal with unforeseen problems arising in the operation i.e. programs ma! need to be dealt with unforeseen circumstances. o confirm that the planning objects have been met and if not work to achieve so. o ensure that the s!stem is able to cope with changing re.uirements.
I%0LE%NTATION 0RO1EDIRE: he users in the organi"ation are familiar with the basics of computers but will not be aware with working of the new s!stem. # training program will be conducted for three da!s to guide the user about the new s!stem. #fter the completion of the training program actual implementation will start as follows67 A. Pilot run of s!stem. 6. Parallel run of s!stem. 1. &hange over of the s!stem. 0i"ot Run of S#stem: In this phase historical data will be entered into the s!stem as test data and the output of the s!stem will be checked against the historical reports. 0ara""e" Run of S#stem: In this phase both the s!stems will be run in parallel form for about two to three months and the results of both will be checked manuall!. #fter the completion of the time period, s!stem will be handed over to the management. 1&ange Over of t&e S#stem:
his is the last phase of the implementation procedure. In this phase all the data will be entered into the s!stem b! the user and the management will discontinue the manual s!stem.
Enrollment No. Page 1:(
SYSTEM SECURITY MEASURES

o do an ade.uate job on securit!, a s!stems anal!st must anal!"e the risk, exposure, and costs and specif! measures such as passwords and encr!ption to provide protection. he backup copies of software and recover! restart procedures must be available when needed. his s!stem will provide the facilities for both customer 8 operators on the same portal. 'o securit! constraints must be applied carefull!. # customer wouldnGt re.uire to login into the reservation s!stem for reservation. Fe will simpl! view all the information on web. <hile a counter assistant will re.uire to have user I; 8 Password. #fter proper validation checking of that operator he can make transactions. Fis total transaction details will also be recorded along with his I; in a log able, so that an! misusage of the s!stem can be prohibited. '!stem securit! refers to various validations on data in form of checks and controls to avoid the s!stem from failing. It is alwa!s important to ensure that onl! valid data is entered and onl! valid operations are performed on the s!stem. he s!stem emplo!s two t!pes of checks and controls6
1"ient Side Se!urit# 3arious client side validations are used to ensure on the client side that onl! valid data is entered. &lient side validation saves server time and load to handle invalid data. 'ome checks imposed are6 # Aava'cript program is used to fill up date in the date fields onl!. Aava'cript is used to ensure that numeric field is filled with numeric data onl!. %aximum lengths of the fields of the forms are appropriatel! defined. 4orms can not be submitted without filling up the mandator! data so that manual mistakes of submitting empt! fields that are mandator! can be sorted out at the client side to save the server time and load.
Enrollment No. Page 1:)
ab7Indexes are set according to the need and taking into account the ease of user while working with the s!stem.
Server Side Se!urit# 'ome checks canGt be applied at client side. 'erver side checks are necessar! to save the s!stem from failing and intimating the user that some invalid operation has been performed or the performed operation is restricted. 'ome of the server side checks imposed are6 'erver side constraint has been imposed to check for the validit! of Primar! ke! and foreign ke!. # primar! ke! value cannot be duplicated. #n! attempt to duplicate the primar! ke! value results into a message intimating the user about that. 3alues through the forms using foreign ke! can be updated onl! for the existing foreign ke! values. ,xceptions are caught in the programs and are used constructivel! to avoid s!stem failure. -ser is intimated through appropriate messages about the successful operations or exceptions occurring at server side. #ccess permissions to various t!pes of users are controlled according to the organi"ational structure. $nl! permitted users can log on to the s!stem and can have access according to their categor!. -ser7name, passwords and permissions are controlled on the server side.
%ERT cha)t an1 GANTT cha)t

0ERT 1&art:
Enrollment No. Page 1:*
1 A->
'tart
1 A->, 1#-@
#nal!sis and ;esign
2#-@ , 2: #-@
raining on iIutton
Felp
esting
&oding
#PI ;evelopment
25 ',P
2( ',P,15 ',P
2:#-@, 15 ',P
2#-@ , 2: #-@
# P,0 &hart is a network of boxes and arrows. each will take.
o create P,0 chart, first we he
need to list all the activities re.uired for completion of the project and estimate how long hen we must determine the dependence of activities on each other. P,0 chart gives a graphical representation of this information. P,0 chart is alwa!s used b! the project manager to answer the .uestions like which all activities are necessar! or there in the project and how long each will take. Fere we are using boxes to represent the activities. he arrows are used to show the dependencies of activities on one another. he activit! at the head of an arrow cannot start until the activit! at the tail of the arrow is finished. he boxes in a P,0 chart can be decorated with starting and ending dates for activities.
5ANTT 1&art: @#/ charts are a project control techni.ue that can be used for several purposes, including scheduling, budgeting, and resource planning. # @antt chart is a bar
Enrollment No. Page 1:+
chart, with each bar representing an activit!.
he bars are drawn against a time line.
he
length of each bar is proportional to the length of time planned for the activit!.
1 A-> tart *nalysis 2 &esign
1 #-@
2: #-@
15 ',P
25 ',P
Training &e#elopin g *(! 1oding est Felp file creati on 4inish
FUTURE SCO%E OF T&E %ROJECT

his project DF$0IM$/ #I0<#?' 0,',03# I$/ '?' ,%E is ver! flexible and simple. he s!stem will be developed as a module of the airwa!s s!stem and will be well documented. 4ollowing modifications are possible in future6 /ew modules and functionalit! can be added without man! troubles. #utomatic reservation b! customer through &redit &ard /o. 8 PI/ /o. his module should be developed as an affiliate program that can be easil! integrated with various <eb sites.
REFERENCES
7uring making t"is project I learn c99 and for programming. I took "elp from t"ese various ooks.
'. O,@e!t Oriented programming J Ro,ert "afore ( ). O,@e!t oriented programming J E.6a"agurusam# ( *. Introdu!tion to !??JSumita arora( 3. Let Is 1J$as&.ant 7anit7ar( 8. Soft.are Engineering: RO5ER S 0RESS%AN 9. S#stem Ana"#sis and Design %et&ods: 5AL5OTIA 0I6LI1ATIONS

Airline System Project

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Airline System Project

Transféré par

Droits d'auteur :

Formats disponibles

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 1

Enrollment No. Page 2

! wish the student the best for his academic #entures$

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 3

Signature of Supervisor: Name of Supervisor: . Date:

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page (

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page )

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page *

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page +

he passenger is assigned a uni.ue Passenger /ame 0e.uest

Enrollment No. Page 5

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 9

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 1:

T&e Initia" Investigation and Identifi!ation of need :

Enrollment No. Page 11

Enrollment No. Page 12

Enrollment No. Page 13

Enrollment No. Page 1(

"# T$%&' '()I(''&I() P%&%*I"+

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 1)

and progress through anal!sis, design,

coding and module testing, deliver! and maintenance. .ueries and

Enrollment No. Page 1*

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 1+

%LATFORM USED -ard.are Re/uirement

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 15

Enrollment No. Page 19

Enrollment No. Page 2:

Enrollment No. Page 21

he same principle can also appl! to programming. 4or example,

Enrollment No. Page 22

#** Imp(ements OOP

Enrollment No. Page 23

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 2(

strategic risk. (,* &"e soft$are is easily understanda le

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 2)

OJBECT ORIENTED DEVELO%MENT

Enrollment No. Page 2*

WORK FLOW T&E %ROJECT

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 2+

Steps in feasi,i"it# ana"#sis

Eig&t steps are invo"ved in t&e feasi,i"it# ana"#sis. T&e# are :

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 25

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 29

AIR AIR LINES RESERVATION SYSTEM

Enrollment No. Page 3:

AIR AIR LINES RESERVATION SYSTEM