Airline Reservation System

AIRLINE RESERVATION SYSTEM USING FACTORY PATTERN

Design pattern project

 

(swe501)

by  

Name:M.Vijimichiko

 

Reg:no:12mse0311 Slo:!1 slo "ac#ly: ac#ly: Senhil Senhil

k#ma$.M

Abstract Providing a better classified system with subclasses for all standards and behaviors so that the object provided within is obtained from the classes provided. The pattern enhances the system to provide the requirements for classes and its attributes. The airline is generally classified into service classes. This system provides a better user  interface with the subclasses, databases system provides a classified data collection for the passenger class selection, in order to provide a inventory management, database is on administration part as classified. The system display list of available flights and allows passenger to choose a particular flight. Then the system checks for the availability of  seats on the flight. If the seats are available then the system allows the  passenger to book a seat. therwise it asks the user to choose another  flight and the ticket is booked according to it passenger convenience.

Literature survey !

In "#$ application of design pattern in web application is given  as case study. In "%$ decorator pattern is applied and implemented in web application. Decorator pattern add additional responsibility and make the application adjustable to future changes.

In "&$ a short and precise description on concept of patterns is discussed and brief introduction of various pattern like 'dapter pattern, factory pattern, and abstract factory pattern is given. In "($, they proposed application of design pattern for airline reservation system. In this system they have used strategy pattern, 'bstract factory pattern and bridge pattern as a reusable solution.

Proposed system:

%he &'RN* R*S*RV'%+N S,S%*M- #ne$akes as a /$ojec base on $elean echnologies. %he main aim o!  his /$ojec is o eelo/ he so!wa$e !o$ he /$ocess o!  $ese$ing ai$way icke sho#l lea o inc$ease eciency an $e#ce $awbacks which we$e /$esen in he /$eio#s /$oce#$e o! ai$line $ese$aion. %he so!wa$e sho#l be e$$o$ con$olle boh logically as well as in synacic manne$. %he !ea#$es eal wih he ie$en o/e$aions

inole

in

he

/$ocess

o!

&'RN*

R*S*RV'%+N-. 4#siness /eo/le on hae any /lanne ai$ $ael. %hey j#s $eceie he iniaion !o$ some ine$naional e6hibiion a he las min#e which hey sho#l o$ can aen o im/$oe hei$ abiliy boh in he skille man/owe$ an also in he machine$y im/o$ing. Some agens o$ he o$gani7aion wih he iea o! eyeing

inc$ease /$o8 h$o#gh he e6$a a6es !o$ he com!o$ hey gie o b#y he icke.

Novelty of the work: Fatory Metho!: • "e#$e a$ %$terfae for reat%$& a$ o'(et) '*t

let

+*'la++e+

!e%!e

wh%h

la++

to

%$+ta$t%ate, Fatory Metho! let+ a la++ !efer %$+ta$t%at%o$ to +*'la++e+

9a$ic/ans: 9$o#c (a#henicaion) onc$ee 9$o#c (men#eail$ese$aion) $eao$ (;e /aymen y/e) onc$ee $eao$ (9$og$am).

#)*light +ooking! Domestic *lights International *light %)-eating 'rrangement!  

+usiness *irst class ormal class

&)/alendar!

 

Date

 

Time

'lternative patterns! #) Decorator  'ttach additional responsibilities to an object dynamically. Decorators provide a fle0ible alternative to sub classing for e0tending functionality 10ample!  

party +usiness trips

%) 'dapter!

2 /onvert the interface of a class into another interface clients e0pect. 'dapter lets classes work together that couldn3t otherwise because of incompatible interfaces.

10ample! #)Passenger 444445'ir hostess %)pilot 4444445'ir hostess

Coding:

im/o$ jaa.#il.Scanne$< /#blic class 'i$line = boolean>? seaing @ new boolean>11?< AB c$eae 10 sea n#mbe$s (a$$ay>0? will no be #se). *m/y sea inicae by !alseBA Scanne$ in/# @ new Scanne$(Sysem.in)< /#blic oi sa$() = while ( $#e ) = makeRese$aion()< C C /#blic oi makeRese$aion() = Sysem.o#./$inln(D9lease y/e 1 !o$ "i$s lass o$ 2 !o$ *conomy: D)< in secion @ in/#.ne6n()<

i! ( secion @@ 1 ) = 8$slassSea()< C else = economySea()< C C /#blic oi 8$slassSea() AA assign a 8$s class sea = !o$ ( in co#n @ 1< co#n E@ 5< co#nFF ) = i! ( seaing>co#n? @@ !alse ) AA i! !alse hen a sea is aailable !o$ assignmen = seaing>co#n? @ $#e< AA assign sea Sysem.o#./$in!(D"i$s lass. SeaG HInD co#n)< b$eak< C

else i! ( seaing>5? @@ $#e ) AA ! seaing>5? is $#e hen 8$s class is !#lly booke = i! ( seaing>10? @@ $#e) AA ! seaing>10? is $#e hen economy (an he$e!o$e whole Jigh) is !#lly booke = Sysem.o#./$inln(DSo$$y Jigh !#lly booke. Ne6 Jigh is in 3 ho#$s.D)< C else AA ask /assenge$ i! hey wo#l like an economy icke insea = Sysem.o#./$inln(D"i$s lass is !#lly booke. Ko#l yo# like *conomyL 1 !o$ ,es 2 !o$ NoD)< in choice @ in/#.ne6n()< i! ( choice @@ 1 ) = economySea()< sa$()< C else = Sysem.o#./$inln(DNe6 Jigh is in 3 ho#$s.D)<

Sysem.e6i(0)< C C C C C /#blic oi economySea() AA assign an economy sea = !o$ ( in co#n @ < co#n E@ 10< co#nFF ) = i! ( seaing>co#n? @@ !alse ) AA i! !alse hen a sea is aailable !o$ assignmen = seaing>co#n? @ $#e< AA assign sea Sysem.o#./$in!(D*conomy. SeaG HInD co#n)< b$eak< C else i! ( seaing>10? @@ $#e ) AA ! seaing>10? is $#e hen economy is !#lly booke =

i! ( seaing>5? @@ $#e) AA ! seaing>5? is $#e hen 8$s class (an he$e!o$e whole Jigh) is !#lly booke = Sysem.o#./$inln(DSo$$y Jigh !#lly booke. Ne6 Jigh is in 3 ho#$s.D)< Sysem.e6i(0)< C else AA ask i! /assenge$ wo#l like a 8$s class icke insea = Sysem.o#./$inln(D*conomy is !#lly booke. Ko#l yo# like "i$s lassL 1 !o$ ,es 2 !o$ NoD)< in choice @ in/#.ne6n()< i! ( choice @@ 1 ) = 8$slassSea()< sa$()< C else = Sysem.o#./$inln(DNe6 Jigh is in 3 ho#$sD)< Sysem.e6i(0)< C C C C C C