PUNJABUNI

VERSI
TYSWAMISARWANANDGI
RIREGI
ONALCENTER

Hospi
REPORTON“ tal
ManagementSy
stem pr
oject
”

SUBMI
TTEDTOWARDSTHE
PARTI
ALFULFI
LLMENTOFTHEREQUI
REMENTOF

BACHELOROFENGI
NEERI
NG(
Comput
erEngi
neer
ing)
BY

AKASHBHARDWAJ
SG-
17304

UnderTheGui
danceof
Pr
of.NAVEENDOGRA

DEPARTMENTOFCOMPUTERENGI
NEERI
NG
PUNJABUNI
VERSI
TYSWAMISARWANANDGI
RIREGI
ONALCENTER
Hoshi
arpur
,Punj
ab
 ACKNOWLEDGEMENT

Asapar tofcurr
iculum atUNIVERSI
TYI NSTITUTEOFENGINEERI NG&
TECHNOLOGY, Hoshiarpur
,themakingapr oj
ectai
msatov er
all
developmentofthe
st
udent sbyprovi
dingthem anopportunit
ytoapplyt
hei
rtheoret
ical
knowledgein
pract
ice.
Throughthisreport
,Itaketheoppor t
unitytoexpressoursi nceregrati
tudeand
thankf
ulnesstoallthosewhohav ehelpedmei nmaki ngmyt rai
ningasuccess.Fi
rst
ofall
,IwouldliketothankMr .H.S.Bains(Direct
or,U.I
.E.T.PUSSGRC)f orhav
ing
suchasy stem inpl
ace,wherestudentsar egivenopportuniti
est olear
nabouttheir
areasofinter
est,aspartoftr
ainingandi nt
ernshipprograms.
Iwoul
dl i
ketothankMr .NaveenDograSirf
ortaki
ngti
meoutofhi
sbusyschedul
e
andhelpi
ngmei neverypossibl
eway ,t
oproceedwit
hmywork.Hehasbeena
const
antsourceofinspir
ati
onthroughoutt
heproj
ect.
 I
NTRODUCTI
ON

TheHospitalManagementSystem (
HMS)i sdesignedforAnyHospi t
alto
repl
acetheirexi
sti
ngmanual,
paperbasedsy stem.ThisSyst
em targetst
o
provi
decompl et
esoluti
onf
orHospitalandHeal t
hcareservi
ces.This
Syst
em canbeusedi nanyHospital
,Cli
nic,Di
agnosti
csorPathologylabs
formaint
ainingdetai
l
sandthei
rtestresult
s.
I
tInt
egr
atest
heenti
reResour
cesofaHospi
tal
int
oOneI
ntegr
ated
Soft
war
eAppli
cat
ion.
Thepur poseoft hepr oj
ectentitl
edas" HOSPI TALMANAGEMENTSYSTEM
i
st ocomput eri
zet heFrontOf fi
ceManagementofHospi taltodev elop
softwar ewhi chisuserf r
iendlysimpl e,fast, andcost -
eff
ect i
ve.Itdeal swi t
h
thecol lecti
onofpat ient
'sinformat ion,diagnosi sdet ail
s,etc.Traditi
onal ly,
it
wasdonemanual l
y.Themai nfunct ionoft hesy stem isregistorepat i
ent
detailsanddoct ordet ai
lsandr etrievethesedet ail
sasandwhenr equired,
andal sot omani pulatethesedet ailsmeani ngf ullySy st
em inputcont ains
patientdet ail
s,diagnosisdet ail
s,whi lesy stem out puti
stogett hesedet ai
ls
ont ot hescr een.TheHospi talManagementSy stem canbecnt eredusi nga
user nameandpasswor d.Itisaccessi bleci therbyanadmi nist
ratoror
recept i
onistOnl ytheycanadddat ai ntot hedat abase.Thedat acanbe
retr
iev edsily.Thedat aarewel lprotectedf orper sonaluseandmakest he
datapr ocessingv eryfast.
 I
NDEX

1.I
NTRODUCTI
ON
1.
1Int
roduct
ion
1.
2Pr
obl
em i
ntr
oduct
ion
2.REQUI
REMENTSSPECI
FICATI
ON
2.
1Int
roduct
ion
2.
2Har
dwar
erequi
rement
s
2.
3Sof
twar
erequi
rement
s
3.ANALYSI
S
3.
1Exi
sti
ngSy
stem
3.
2Pr
oposedSy
stem
4.KNOWLEDGEUSED
4.
1C++
4.
2Li
nkedLi
st
4.
3Doubl
eLi
nkedLi
st
4.
4Queuedat
ast
ruct
ure
4.
5St
ackdat
ast
ruct
ure
4.
5Tr
eedat
ast
ruct
ure
5.SYSTEM I
MPLEMENTATI
ON
5.
1Int
roduct
ion
5.
2Sampl
ecode
6.TESTI
NG
6.
1Int
roduct
ion
6.
2test
ingmet
hods
7.SAMPLESCREENSHOTS
8.CONCLUSI
ON
9.BI
BLOGRAPHY

CHAPTER1
I
NTRODUCTI
ON

1.
1Int
roduct
ion:

Thepr oj
ectHospi talManagementsy st
em includesregi
str
ationofpat ients,
stori
ngt heirdetai
lsintothesy stem,andal socomput eri
zedbi l
lingint he
pharmacy ,andl abs.Thesof t
war ehast hef acil
i
tytogiveauni queidf or
every patientand st ores t
he det ail
s ofev er
y pati
entand t he st aff
automatically
.Itincludesasear chf acil
i
tytoknow t hecur rentstatusof
eachr oom.Usercansear chav ail
abil
i
tyofadoct orandt hedet ail
sofa
pati
entusingt heid.

TheHospitalManagementSy stem canbeenter

edusi ngausernameand
password.Itisaccessi
bleeitherbyanadminist
ratororrecept
ionist
.Only
theycanadddat aintothedatabase.Thedat
acanber etr
iev
edeasi l
y.The
i
nterf
aceisv er
yuser-fr
iendl
y.Thedat aar
ewellprotect
edforpersonaluse
andmakest hedataprocessingv er
yfast
.

Hospi
talManagementSy
stem i
spowerful
,fl
exi
ble,andeasyt
ouseandi s
desi
gnedanddevel
opedt
odeli
verr
ealconcei
vabl
ebenefit
stohospi
tal
s.
Hospit
alManagementSy st
em i sdesignedformulti
special
i
tyhospit
als,to
coverawi derangeofhospitaladminist
rat
ionandmanagementpr ocesses.
Iti
sani ntegrat
edend-t
o-endHospi talManagementSy stem t
hatprovides
rel
evantinformati
onacrosst hehospi t
altosupporteffect
ive deci sion
making forpat i
entcare,hospi t
aladmi nist
rat
ion and cri
ti
calfi
nanci al
account
ing,inaseamlessflow.
Hospi
talManagementSy stem isasof t
warepr oductsui
tedesignedt o
i
mprovethequal
ityandmanagementofhospi t
almanagementi ntheareas
of cl
ini
cal pr
ocess anal ysi
s and act i
vi
ty-
based costing. Hospital
ManagementSy stem enables you t
o devel
op y ourorganizat
ion and
i
mprov ei
tseff
ecti
venessandquali
tyofwork.Managingthekeypr
ocesses
ef
fi
cientl
yiscr
iti
caltothesuccessofthehospi
talhelpsyoumanageyour
pr
ocesses

1.
2Pr
obl
em I
ntr
oduct
ion:

Lackofi
mmedi
ater
etr
iev
als:-
Theinf
ormationisv erydif
fi
cultt
oretri
eveandt ofi
ndparti
cul
ari
nfor
mat i
on
l
ike-E.
g.-Tof i
ndoutaboutt hepat
ient
’shist
ory,t
heuserhastogothrough
vari
ousregi
sters.Thisresult
sininconv eni
enceandwastageoft
ime.
Lackofi
mmedi
atei
nfor
mat
ionst
orage:-
Theinf
ormat
iongenerat
edbyv
ari
oust
ransact
ionst
akest
imeandef
for
ts
tobestor
edatr
ightpl
ace.
Lackofpr
omptupdat
ing:-
Variouschangestoinf
ormat
ionl
ikepat
ientdet
ail
sorimmuni
zat
iondet
ail
s
ofchil
daredif
ficul
ttomakeaspaperworkisi
nvol
ved.
Er
rorpr
onemanualcal
cul
ati
on:-
Manualcalcul
ati
onsareer
rorpr
oneandtakealotoft
imethismayresul
tin
i
ncorrectinf
ormati
on.Forexampl
ecalcul
ati
onofpat i
ent
’sbil
lbasedon
var
ioustreat
ments.
Pr
epar
ati
onofaccur
ateandpr
omptr
epor
ts:-
Thi
sbecomesadif
fi
cul
ttaskasi
nfor
mat
ioni
sdi
ff
icul
ttocol
l
ectf
rom
var
iousr
egi
ster
.

Obj
ect
ive:
-

1)Def
inehospi
tal
 2)Recor
dingi
nfor
mat
ionaboutt
hePat
ient
sthatcome.

3)Gener
ati
ngbi
l
ls.

4)Recor
dingi
nfor
mat
ionr
elat
edt
odi
agnosi
sgi
vent
oPat
ient
s.

5)Keepi
ngr
ecor
doft
heI
mmuni
zat
ionpr
ovi
dedt
ochi
l
dren/
pat
ient
s.

6)Keepi
ngi
nfor
mat
ionaboutv
ari
ousdi
seasesandmedi
cinesav
ail
abl
e
t
ocur
ethem.

Thesear
ethev
ari
ousj
obst
hatneedt
obedonei
naHospi
talbyt
he
oper
ati
onal
staf
fandDoct
ors.Al
lthesewor
ksar
edoneonpaper
s.

Scopeoft
hePr
oject
:-

1)I
nfor
mat
ionaboutPat
ient
sisdonebyj
ustwr
it
ingt
hePat
ient
sname,
ageandgender
.Whenev
ert
hePat
ientcomesuphi
sinf
ormat
ioni
s
st
oredf
reshl
y.

2)Bi
l
lsar
egener
atedbyr
ecor
dingpr
icef
oreachf
aci
l
itypr
ovi
dedt
o
Pat
ientonasepar
atesheetandatl
astt
heyal
lar
esummedup.

3)Di
agnosi
sinf
ormat
ion t
o pat
ient
sis gener
all
yrecor
ded on t
he
document
,whi
chcont
ainsPat
ienti
nfor
mat
ion.I
tisdest
roy
edaf
ter
somet
imeper
iodt
odecr
easet
hepaperl
oadi
ntheof
fi
ce.

4)I
mmuni
zat
ionr
ecor
dsofchi
l
drenar
emai
ntai
nedi
npr
e-f
ormat
ted
sheet
s,whi
char
ekepti
naf
il
e.

5)I
nfor
mat
ionaboutv
ari
ousdi
seasesi
snotkeptasanydocument
.
Doct
orst
hemsel
vesdot
hisj
obbyr
emember
ingv
ari
ousmedi
cines.

Al
lthi
swor
kisdonemanual
l
ybyt
her
ecept
ioni
standot
heroper
ati
onal
st
affandl
otofpaper
sar
eneededt
obehandl
edandt
akencar
eof
.Doct
ors
hav
eto r
emember v
ari
ous medi
cines av
ail
abl
efor di
agnosi
s and
somet
imesmi
ssbet
teral
ter
nat
ivesast
heycan’
tremembert
hem att
hat
t
ime.

CHAPTER2
REQUI
REMENTSPECI
FICATI
ON

2.
1INTRODUCTI
ON:
Tobeusedef f
ici
ently,al
lcomput ersof t
wareneedscer t
ainhardwarecomponent sorthe
othersoft
war eresourcest obepr esentonacomput er.Thesepr e-
requisi
tesareknown
as(computer)system requirementsandar eof t
enusedasagui deli
neasopposedt oan
absolut
erule.Mostsof t
war edefinest wosetsofsy stem requir
ement s:mi ni
mum and
recommended.Wi thincreasingdemandf orhigherpr ocessingpowerandr esourcesin
newerv er
sionsofsof tware,sy st
em r equi
rementst endt oincreaseov ertime.Industr
y
analyst
ssuggestt hatthist rendpl aysabi ggerparti ndrivi
ngupgr adest oex i
sti
ng
comput
ersy
stemst
hant
echnol
ogi
cal
adv s.
ancement

2.
2HARDWAREREQUI
REMENTS:
Themostcommonsetofr equir
ement sdefinedbyanyoper atingsystem orsof twar
e
appli
cati
onist hephy sicalcomput erresources,al
soknownashar dwar e.Ahar dwar
e
requi
rementsl istis of ten accompani ed by a hardware compat ibi
lityli
st( HCL),
especial
l
yin case ofoper at
ing systems.An HCL l istst ested,compat i
bil
i
ty and
sometimes incompat ible hardware dev i
ces fora par ti
cularoperating system or
appli
cati
on.The f ol
lowi ng sub-secti
ons discuss the vari
ous aspects ofhar dwar
e
requi
rements.

HARDWAREREQUI
REMENTSFORPRESENTPROJECT:
PROCESSOR : I
nteldual
Cor
e,i
3
RAM : 1GB
HARDDI
SK : 80GB

2.
3SOFTWAREREQUI
REMENTS:

Softwar eRequir
ementsdealwithdef
ini
ngsof t
war eresourcerequir
ement sandpre-
requisit
esthatneedtobeinst
all
edonacomput ertoprovideoptimalfuncti
oni
ngofan
appli
cat i
on.Theserequi
rementsorpre-r
equi
sitesaregener all
ynoti ncl
udedi nthe
softwareinstal
l
ati
onpackageandneedtobeinstal
ledseparatel
ybeforethesoft
wareis
i
nstalled.

SOFTWAREREQUI
REMENTSFORPRESENTPROJECT:
OPERATI
NGSYSTEM : Wi
ndows7/XP/
8
FRONTEND : codebl
ocks/
tur
boc++.Et
c.
 CHAPTER3
ANALYSI
S

3.
1EXI
STI
NGSYSTEM:
Hospitalscurrent l
yuseamanualsy stem f orthemanagementandmai ntai
nanceof
cri
ti
cali nfor
mat ion.Thecur rentsystem r equir
esnumer ouspaperf orms,withdat a
stor
esspr eadt hroughoutt hehospit
almanagementi nf
rastr
ucture.Of
teninf
ormationis
i
ncompl eteordoesnotf ol
low managementst andar
ds.Formsar eof
tenlostintr
ansit
betweendepar tmentsrequi r
ingacompr ehensiveaudi
tingprocesstoensur ethatno
vi
talinformationi slost
.Mul tipl
ecopiesoft hesamei nformationexi
stinthehospi t
al
andmayl eadtoi nconsi
stenciesindat
ai nvariousdat
ast or
es.

3.
2PROPOSEDSYSTEM:
TheHospitalManagementSy st
em i
sdesi gnedforanyhospit
altoreplacetheirex
isti
ng
manualpaperbasedsystem.Thenewsy stem i
stocontrolt
heinformat i
onofpat i
ents.
Room avai
labi
li
ty,st
affandoper at
ingr oom schedulesandpat ientinvoices.These
servi
cesaretobepr ovidedinanef f
icient,costeff
ecti
vemanner ,withthegoalof
reduci
ngt
het i
meandr esour
cescurr
entlyrequir
edforsuchtasks.

CHAPTER4
KNOWLEDGEUSED
4.
1 C++:
C++  (
isa  gener al-
purposepr ogrammi nglanguage  creat edby Bj
arne
Str
oustrup asanext ensionoft he Cprogr ammi ngl anguage, or"C
wit
h Classes" .Thel anguagehasexpandedsi gnifi
cant l
yov ert ime,and
moder nC++nowhas  object
-oriented,
 generic,and  functional feat
uresin
addi
t i
ont ofacilit
iesf or 
low-level 
memor y manipulat ion.Itisal mostalways
i
mpl ement edasa  compi ledlanguage, andmanyv endor spr ov i
de 
C++
compi l
ers,includingt he FreeSof tware
Foundation, LLVM,  Mi cr
osoft, 
Intel
, Or
acle,and  IBM, soi tisav ail
ableon
manypl atforms.
C++wasdesignedwit
habiastowar
d sy
stem pr
ogr
ammi ng 
and 
embedded,
resour
ce-
const
rai
nedsof
twareandl
argesyst
ems,wit
h per
for
mance,
effi
ciency,andf l
exibil
i
tyofuseasi tsdesignhighli
ght
s.C++hasalsobeen
foundusef ul i
nmanyot hercontexts,withkeystrengt
hsbeingsoft
ware
i
nfrastructureandr esource-const
rainedapplicati
ons,
 i
ncl
uding 
deskt
op
applicati
ons, vi
deogames,  server
s (e.
g. e-
commer ce,
 Websearch,
or 
SQL  servers),andperformance-crit
icalappli
cati
ons(e.
g. 
tel
ephone
switches or spaceprobes).
C++i sst andar dizedbyt he I
nternat i
onal Organi zati
onf or
Standar di zati
on  (ISO) ,withthel atestst andar dv er
sionr atifi
edand
publishedbyI SOi nDecember2017as  I
SO/ IEC14882: 2017  (i
nformall
y
knownas  C++17) .TheC++pr ogr ammi ngl anguagewasi nit
ial
ly
standar di zedi n1998as  ISO/IEC14882: 1998, whichwast henamendedby
the C++03,  C++11  and C++14  standar ds.Thecur r
entC++17st andard
super sedest hesewi thnewf eatur esandanenl arged standar dli
brary.
Befor et hei ni
t i
al standar dizati
oni n1998, C++wasdev elopedbyDani sh
comput ersci ent ist BjarneSt r
oust rup at  BellLabs since1979asan
extensi onoft he  Cl anguage; hewant edanef fi
cientandf l
exiblelanguage
similart oCt hatal sopr ovided high-lev el f
eatures forpr ogram
[13]
organi zation.   C++20  ist henextpl annedst andar d,keepi ngwi ththe
currentt rendofanewv ersionev er ythr eey ears.

4.
2LI
NKEDLI
ST
In comput ersci ence,a linkedl i
st i
sal i
nearcol lectionofdat a
element swhoseor deri snotgi v
enbyt hei
rphy sicalplacementi nmemor y.
Instead, eachel ement  
points tothenext .Itisa datast ructure consisti
ngof
acol lectionof nodes  whicht oget herrepresenta  sequence.I ni t
smost
basi cform, eachnodecont ains:  
data,anda  reference (i
not herwor ds,a l
i
nk)
tot henextnodei nt hesequence.Thi sst r
uctur eall
owsf oref f
icient
i
nser tionorr emov al ofelement sf r
om anyposi ti
oni nthesequencedur i
ng
i
t erati
on.Mor ecompl exv ar
iant saddaddi t
ional l
inks,allowingmor e
ef f
ici
enti nserti
onorr emov al ofnodesatar bitrar
yposi tions.Adr awbackof
l
inkedl i
stsisthataccesst i
mei slinear(anddi ffi
cultto pipeli
ne).Fast er
access, suchasr andom access, isnotf easible. 
Arrays hav ebet ter
 cache
l
ocal ity 
compar edtol inkedlists.
Ali
nkedli
stwhosenodescontai
ntwofiel
ds:ani
ntegerval
ueandali
nkto
thenextnode.Thel
astnodeisl
inkedtoatermi
natorusedtosi
gni
fyt
he
endoftheli
st.
Linkedli
stsareamongt hesimplestandmostcommondat ast r
uctur
es.
Theycanbeusedt oimplementsev er
alothercommon abstr
actdatatypes,
i
ncluding 
li
sts,
 st
acks,
 queues,
 associ
ati
vearrays,
and 
S-expressi
ons,
thoughitisnotuncommont oimplementthosedatast
ructur
esdi r
ectl
y
withoutusingali
nkedlistasthebasis.
Thepr i
ncipalbenefi
tofal i
nkedl i
stoveraconv enti
onal  
array i
st hatthel
ist
elementscanbeeasi l
yinsertedorremov edwi thoutr eal
locat i
onor
reorganizati
onoftheent i
restruct
urebecauset hedat aitemsneednotbe
stored 
cont i
guously
 i
nmemor yorondisk, whil
er estruct
ur inganar ray
at r
un-ti
me  i
samuchmor eexpensiveoper ati
on.Linkedl istsallowinsert
ion
andr emov alofnodesatanypoi ntinthelist,andallowdoi ngsowi t
ha
constantnumberofoper ati
onsbykeepi ngt helinkprev i
oust ot heli
nk
beingaddedorr emovedinmemor yduringl i
sttraversal.
Ont heotherhand, si
ncesi mplel i
nkedl i
stsbythemsel v
esdonot
all
ow random access tothedat aoranyf orm ofeffi
cientindexi ng,many
basicoperations—suchasobt aini
ngt helastnodeoft heli
st ,
findinganode
thatcontainsagivendat um, orlocatingtheplacewher eanewnodeshoul d
beinserted—mayr equireiterat
ingt hroughmostoral lofthelistelements.
Theadv antagesanddi sadv ant
agesofusi ngli
nkedl i
stsar egivenbel ow.
Linkedli
staredy namic,sot helengt hofli
stcani ncreaseordecr easeas
necessary.Eachnodedoesnotnecessar il
yfoll
owt hepr eviousone
physical
lyinthememor y.

4.
3DOUBLELI
NKEDLI
ST
In 
computerscience,a doubl
yli
nkedli
st 
isa l
i
nkeddat a
str
uct
ure 
thatconsist
sofasetofsequent i
all
yli
nked r
ecords 
cal
led nodes.
Eachnodecontainsthree 
fi
elds:t
woli
nkfiel
ds(ref
erences t
othepr evi
ous
andtothenextnodei nthesequenceofnodes)andonedat afi
eld.The
beginni
ngandendi ngnodes' pr
evious 
and next
 l
inks,r
especti
vel
y,pointt
o
someki ndoft erminat
or,ty
picall
ya sent
inelnode or
 nul
l,
tofacil
i
tate
tr
aversal ofthel
ist.I
fther
eisonl yonesentinel
node, t
hentheli
stis
cir
cular
lyl i
nkedviathesentinelnode.I
tcanbeconcept ual
izedas
two si
nglylinkedli
sts 
formedf r
om thesamedat ai t
ems,butinopposite
sequentialorder
s.

Thet wonodel i
nksall
owtraversaloft helistinei t
herdirecti
on.While
addingorr emovi
nganodei nadoubl yli
nkedl i
strequireschangingmor e
l
inkst hanthesameoperati
onsonasi nglylinkedl i
st,
theoper at
ionsare
simplerandpotenti
all
ymor eeffi
cient( f
ornodesot hert hanfi
rstnodes)
becauset herei
snoneedt okeept rackoft hepr evi
ousnodedur i
ng
tr
aversalornoneedt otr
aversethel i
stt ofindt hepreviousnode, sothati
ts
l
inkcanbemodi fi
ed.

4.
4QUEUEDATASTRUCTURE
In computerscience,a queue i
sa coll
ect i
on ofentit
iesthatar
emai ntai
ned
i
nasequenceandcanbemodi f
iedbyt headdi t
ionofent i
ti
esatoneendof
thesequenceandt heremov alofentit
iesf r
om t heotherendofthe
sequence.Byconv ent
ion,theendoft hesequenceatwhi chel
ement sare
addedi scall
edt heback, t
ail
,orrearoft hequeue, andtheendatwhi ch
elementsarer emov ediscall
edt heheadorf rontofthequeue,anal
ogously
tot hewordsusedwhenpeopl eli
neupt owai tforgoodsorservi
ces.
Theoper ati
onofaddinganel ementtotherearofthequeueisknown
as enqueue,andtheoperati
onofr emovinganelementfrom t
hefrontis
knownas  dequeue.Otheroperati
onsmayalsobeal l
owed,oft
enincludi
ng
a peek 
or f
ront 
operati
onthatretur
nsthevalueofthenextel
ementt obe
dequeuedwi thoutdequeui
ngi t
.
Theoperati
onsofaqueuemakei ta 
fir
st-
in-
fi
rst
-out(FI
FO)dat
ast ructur
e.
I
naFI FOdatastr
uctur
e,thefi
rstelementaddedt othequeuewill
bet he
fi
rstonetoberemoved.Thisisequival
enttotherequir
ementthatoncea
newelementisadded,al
lelementsthatwereaddedbef or
ehav etobe
removedbefor
ethenewel ementcanber emov ed.Aqueueisanexampl e
ofa 
li
neardat astr
ucture,ormor eabstract
lyasequent i
alcol
lect
ion.
Queuesarecommoni ncomput erprograms,wher etheyareimplement
ed
asdatastructur
escoupl edwithaccessr outi
nes,asan abstr
actdata
st
ructur
e orinobject-
orient
edlanguagesascl asses.Common
i
mplement ati
onsar e 
cir
cularbuffer
s and l
i
nkedlists.

Queuespr ov
ideserv i
cesi
n comput erscience,
 t
ransport
,and operat
ions
research 
wherevariousenti
ti
essuchasdat a,object
s,persons,orevent
s
arestoredandheldt obeprocessedl at
er.Inthesecontexts,t
hequeue
perfor
mst hefunct
ionofa buf f
er.Anotherusageofqueuesi sint he
i
mpl ementati
onof breadt
h-fi
rstsearch.

4.
5STACKDATASTRUCTURE
I
n computersci
ence,
a st
ack 
i
san 
abstr
actdatatype t
hatser
vesas
a 
col
l
ection 
ofel
ements,wi
thtwomainpr
inci
paloperat
ions:

 push,
whi
chaddsanel
ementt
othecol
l
ect
ion,
and

 pop,whichr
emov
est
hemostr
ecent
lyaddedel
ementt
hatwasnoty
et
removed.
Theor derinwhi chelementscomeof fast ackgi vesri
setoitsalt
ernati
ve
name,  
LIFO  (
lastin,
fir
stout).Additi
onall
y,a peek operat
ionmaygi ve
[
1]
accesst ot hetopwi t
houtmodi fyi
ngthest ack.  Thename" stack"fort
his
typeofst ructurecomesf r
om t heanalogyt oasetofphy sicali
tems
stackedont opofeachot her.Thisstruct
uremakesi teasytotakeani t
em
offthetopoft hestack,whil
eget t
ingtoani tem deeperinthestackmay
[
2]
requir
et akingof fmult
ipl
eotheritemsf ir
st.
Consi
der
edasa 
l
ineardat
ast
ruct
ure,
ormor
eabst
ract
lyasequent
ial
collecti
on, thepushandpopoper ati
onsoccuronlyatoneendoft he
structure,refer r
edtoast t
he op ofthestack.Thi
sdat astr
ucturemakesi t
possi bl
et oi mpl ementastackasa  singl
yli
nkedlist 
andapoint ertothetop
el
ement .Ast ackmaybei mplement edtohaveaboundedcapaci ty.I
fthe
stacki sfullanddoesnotcont ainenoughspacet oacceptanent it
ytobe
pushed, thest ackisthenconsideredt obeinan 
ov erf
low 
state.Thepop
oper ati
onr emov esanitem f
rom thet opofthestack.

4.
6TREEDATASTRUCTURE
I
n computerscience,a 
tr
ee i
sawi del
yused 
abstr
actdatatype 
(ADT)
thatsi
mulatesahierarchi
cal 
tr
eestructure,wi
tharootvalueandsubtr
ees
ofchil
drenwitha 
parentnode, r
epresentedasasetoflinked 
nodes.
Atreedat astructur
ecanbedef i
ned r
ecursi
vel
y 
asacollecti
onofnodes
(st
arti
ngatar ootnode),
whereeachnodei sadatast
ructureconsi
sti
ngof
avalue,togetherwithali
stofref
erencestonodes(t
he"childr
en")
,withthe
constr
aintsthatnor ef
erencei
sduplicat
ed,andnonepointstotheroot.

Alternati
vely,atreecanbedef inedabst ractl
yasawhol e(global
ly)as
an orderedt ree,withav al
ueassi gnedt oeachnode.Bot hthese
perspect i
vesar eusef ul
:whileat reecanbeanal yzedmat hematicallyasa
whol e,whenact uall
yrepresentedasadat astr
uctureitisusual l
y
representedandwor kedwi t
hsepar atelybynode( r
athert hanasasetof
nodesandan  adjacencyli
st ofedgesbet weennodes, asonemayr epresent
a digraph,forinstance).Forexampl e,lookingatat reeasawhol e, onecan
talkabout" thepar entnode"ofagi vennode, butingener alasadat a
structureagi vennodeonl ycontainsthel i
stofitschildren,butdoesnot
cont
ainar
efer
encet
oit
spar
ent(
ifany
).

CHAPTER5
SYSTEM I
MPLEMENTATI
ON

5.I
MPLEMENTATI
ON:
5.
1Inr
oduct
ion:
Impl
ement at
ionisthest
ageoftheproj
ectwhenthetheoret
icaldesi
gnisturnedout
i
ntoawor kingsy st
em.Thusi tcanbeconsideredtobet hemostcr i
ti
calstagein
achi
evi
ngasuccessf ulnew syst
em andingivi
ngt heuser
,conf i
dencethatthenew
syst
em wi
l
l workandbeef f
ecti
ve.

Theimplementati
onstagei nv
olvescaref
ulplanni
ng,invest
igat
ionoftheex i
sti
ng
syst
em and it
’s const
rai
nts on impl
ementati
on,designi
ng ofmet hods t
o achi
eve
changeov
erandev al
uat
ionofchangeovermethods.

5.
2Sampl
ecode:

#i
ncl
ude<i
ost
ream>
#i
ncl
ude<coni
o.h>
#i
ncl
ude<st
ri
ng.
h>
#i
ncl
ude<st
dli
b.h>
usi
ngnamespacest
d;

st
ructpat
ient
{
 l
ongl
ongI
D;
st
ri
ngf
ir
stname;
st
ri
ngl
ast
name;
i
ntage;
charbl
ood[
5];
chargender
;
pat
ient
*next
;
}
;
cl
assl
i
nkedqueue
{
pat
ient*
head,
*l
ast
;
publ
i
c:
l
i
nkedqueue(
)//
const
ruct
or
{
head=NULL;
l
ast
=NULL;
}
pat
ienti
nput
();
v
oidi
nser
tat
end(
);
v
oidi
nser
tat
beg(
);
v
oidget
pat
ient
out
();
v
oidl
i
stof
pat
ient
s()
;
i
ntsear
ch(
int
);
chardepar
tment
name[
50]
;
}
;
i
ntl
i
nkedqueue:
:sear
ch(
inti
tem)
{
i
f(
head==NULL)
r
etur
nfal
se;
el
se
{
i
ntf
lag=0;
pat
ient
*p=newpat
ient
();
p=head;

whi
l
e(p-
>next
!=NULL&&p-
>ID!
=it
em )
{
p=p-
>next
;
}
i
f(
p->I
D==i
tem)
{
f
lag=1;
r
etur
ntr
ue;
}
i
f(
fl
ag==0)
r
etur
nfal
se;
}
}
i
ntr
eadnumber
()
{
charb[
20]
;
ci
n.get
li
ne(
b,si
zeof
(b)
);
r
etur
nat
oi(
b);
}

pat
ientl
i
nkedqueue:
:i
nput
()/
/taki
ngi
nputoft
hepat
ient
1353
{
i
ntf
lag=0;
pat
ient*
p=newpat
ient
();
cout<<"
\n\
tPl
easeent
erdat
aforpat
ient
\n"
;
cout
<<"
\n\
tFi
rstname :
";
get
li
ne(
cin,
p->f
ir
stname)
;
cout<<"
\tLastname :
";
get
li
ne(
cin,
p->l
ast
name)
;
agai
n:
cout<<"
\tBl
oodGr
oup :
";
ci
n>>p-
>bl
ood;
i
f(
(st
rcmp(p->bl
ood,
"A+"
)==0)
||
(st
rcmp(p-
>bl
ood,
"a+"
)==0)
||
(st
rcmp(
p
-
>bl
ood,"
A-"
)==0)|
|
(str
cmp(p-
>bl
ood,"a-
")
==0)
||
(
strcmp(p-
>bl
ood,"B+"
)==0)|
|
(st
rcmp(p-
>bl
ood,
"b+"
)==0)
||
(st
rcmp(
p
-
>bl
ood,"
B-"
)==0)
||
(st
rcmp(p->bl
ood,
"b-
")
==0)|
|
(
strcmp(p-
>bl
ood,"
O+")
==0)|
|
(st
rcmp(p-
>bl
ood,
"o+"
)==0)
||
(st
rcmp(
p
-
>bl
ood,"
O-"
)==0)
||
(st
rcmp(
p->bl
ood,
"o-
")
==0)|
|
(
strcmp(
p->blood,
"AB+")
==0)|
|
(st
rcmp(p-
>bl
ood,
"ab+"
)==0)
||
(st
rcmp(
p
-
>bl
ood,"
AB-
")==0)|
|(
strcmp(
p->bl
ood,
"ab-
")
==0)
)
 f
lag=1;
i
f(
fl
ag==0)
{
cout
<<"
\nWr
ongEnt
ry.
..
Ent
erav
ali
dBl
oodGr
oup.
.Tr
yAgai
n..
";
got
oagai
n;

}
cout
<<"
\tGender :
(m/
f)"
;
ci
n>>p-
>gender
;
cout
<<"
\tAge :
";
ci
n>>p-
>age;
cout
<<"
\tMobi
l
enumber :
";
ci
n>>p-
>ID;
//=r
eadnumber
()1353;

i
f(
sear
ch(
p->I
D))
{
p-
>ID=0;
cout<<"
\n\
tDat
anotv
ali
d.Oper
ati
oncancel
l
ed.
";
}
r
etur
n*p;
}

v
oidout
put
(pat
ient*
p)
{
 cout
<<"
\n*
***
***
***
***
***
***
***
***
***
***
***
";
cout
<<"
\n\
nPat
ientdat
a:"
;
cout
<<"
\n\
nFi
rstName :
"<<p-
>fi
rst
name;
cout
<<"
\nLastName :
"<<p-
>last
name;
cout
<<"
\nGender :
"<<p-
>gender
;
cout
<<"
\nAge :
"<<p-
>age;
cout
<<"
\nBl
oodGr
oup :
"<<p-
>bl
ood;
cout
<<"
\nMobi
l
eNumber :
"<<p-
>ID;
cout
<<"
\n\
n**
***
***
***
***
***
***
***
***
***
***
**"
;
}
v
oidl
i
nkedqueue:
:i
nser
tat
beg(
)
{
pat
ient
*p=newpat
ient
();
*
p=i
nput
();
i
f(
p->I
D==0)
r
etur
n;

i
f(
head==NULL)

{
head=p;
l
ast
=p;
p-
>next
=NULL;
}
el
se
 {
p-
>next
=head;
head=p;
}
sy
stem(
"cl
s")
;
cout<<"
\n\
tPat
ientadded:
";
out
put
(p)
;
}
v
oidl
i
nkedqueue:
:i
nser
tat
end(
)
{
pat
ient
*p=newpat
ient
();
*
p=i
nput
();
i
f(
p->I
D==0)
r
etur
n;

i
f(
head==NULL)
{
head=p;
l
ast
=p;
p-
>next
=NULL;
}
el
se
{
p-
>next
=NULL;
l
ast
->next
=p;
 l
ast
=p;
}
sy
stem(
"cl
s")
;
cout<<"
\n\
tPat
ientadded:
";
out
put
(p)
;
}
v
oidl
i
nkedqueue:
:get
pat
ient
out
()
{
sy
stem(
"cl
s")
;
i
f(
head==NULL)
{
cout
<<"
\n\
tNoPat
ientt
ooper
ate"
;
}
el
se
{
pat
ient
*p=newpat
ient
();
p=head;
head=head-
>next
;
cout<<"
\n\
tPat
ientt
ooper
ate:
";
out
put
(p)
;
}
}

v
oidl
i
nkedqueue:
:l
ist
ofpat
ient
s()
{
 i
f(
head==NULL)
{
cout
<<"
\n\
tNopat
ient
";
}
pat
ient
*p=newpat
ient
;
p=head;
whi
l
e(p!
=NULL)
{
cout
<<"
\nPat
ientdat
a:"
;
cout
<<"
\nFi
rstName :
"<<p-
>fi
rst
name;
cout
<<"
\nLastName :
"<<p-
>last
name;
cout
<<"
\nGender :
"<<p-
>gender
;
cout
<<"
\nAge :
"<<p-
>age;
cout
<<"
\nBl
oodGr
oup :
"<<p-
>bl
ood;
cout
<<"
\nMobi
l
eNumber :
"<<p-
>ID;
cout
<<"
\n*
***
***
***
***
***
***
***
***
***
***
***
\n"
;
p=p-
>next
;
}
cout
<<"
\n"
;
}

v
oiddepar
tment
menu(
li
nkedqueue*q)
{
i
ntchoi
ce=0,
success;
pat
ientp;
whi
l
e(choi
ce!
=5)
{
sy
stem(
"cl
s")
;
cout
<<"
\n\
n\t
Wel
comeToDepar
tment:
"<<q-
>depar
tment
name;
cout
<<"
\n\
t\t
[1]Addnor
mal
pat
ient
\n"
;
cout
<<"
\t\
t[2]Addcr
it
ical
l
yil
lpat
ient
\n"
;
cout
<<"
\t\
t[3]Takepat
ientt
oDoct
or\
n";
cout
<<"
\t\
t[4]Di
spl
ayl
i
st\
n";
cout
<<"
\t\
t[5]Changedepar
tmentorexi
t\
n";
cout
<<"
\n\
tPl
easeent
ery
ourchoi
ce:
";
choi
ce=r
eadnumber
();

swi
tch(
choi
ce)
{
case1: q-
>inser
tat
end(
);
cout<<"
\n\
tPr
essanykey
";
get
ch(
);
br
eak;

case2:q-
>inser
tat
beg(
);
cout<<"
\n\
tPr
essanykey
";
get
ch(
);
br
eak;
 case3:q-
>get
pat
ient
out
();
cout
<<"
\n\
tPr
essanykey
";
get
ch(
);
br
eak;

case4:sy
stem(
"cl
s")
;
q-
>li
stof
pat
ient
s()
;
cout
<<"
\n\
tPr
essanykey
";
get
ch(
);
br
eak;
}
}
}

i
ntmai
n()
{
i
nti
,choi
ce=0;
l
i
nkedqueuedepar
tment
s[4]
;
sy
stem(
"COLOR5F"
);

whi
l
e(choi
ce!
=5)
{
st
rcpy
(depar
tment
s[0]
.depar
tment
name,
"Gener
alCl
i
nic\
n")
;
st
rcpy
(depar
tment
s[1]
.depar
tment
name,
"Hear
tCl
i
nic\
n")
;
st
rcpy
(depar
tment
s[2]
.depar
tment
name,
"LungCl
i
nic\
n")
;
 st
rcpy
(depar
tment
s[3]
.depar
tment
name,
"Pl
ast
icSur
ger
y\n"
);
sy
stem(
"cl
s")
;
cout
<<"
\n\
t>>>>>>>>>>>>>>>>>>>>>>>>>>"
;
cout
<<"
\n\
tHOSPI
TALMANAGEMENTSYSTEM\
t";
cout
<<"
\n\
t<<<<<<<<<<<<<<<<<<<<<<<<<<\
n\n"
;
f
or(
i=0;
i<4;
i++)
{
cout
<<"
\t"
<<(
i+1)
<<"
:"<<depar
tment
s[i
].
depar
tment
name;
}
cout
<<"
\t5:
Exi
t"
;
cout
<<"
\n\
n\t
Pleaseent
ery
ourchoi
ce:
";
choi
ce=r
eadnumber
();
i
f(
choi
ce>=1&&choi
ce<=4)
{
depar
tment
menu(
&depar
tment
s[choi
ce-
1])
;
}

}
i
f(
choi
ce==5)
cout
<<"
\n\
t\t
Thanky
ou\
n";
cout
<<"
\t\
tBr
oughtToYouByAKASHBHARDWAJ"
;
exi
t(
0);
//sy
stem endcp
}
 CHAPTER6
TESTI
NG

6.
1 I
NTRODUCTI
ONTOSYSTEM TESTI
NG:

Thepur
poseoft
est
ingi
stodi
scov
erer
ror
s.Test
ingi
sthepr
ocess
oft
ryi
ngt
odi
scov
erev
eryconcei
vabl
efaul
torweaknessi
nawor
kpr
oduct
.
I
tpr
ovi
desawayt
ocheckt
hef
unct
ional
i
tyofcomponent
s,subassembl
i
es,
assembl
i
es and/
ora f
ini
shed pr
oductI
tist
he pr
ocess ofexer
cisi
ng
sof
twar
ewi
tht
hei
ntentofensur
ingt
hatt
he

Sof
twar
esy
stem meet
sit
srequi
rement
sanduserexpect
ati
onsanddoes
notf
aili
nanunaccept
abl
emanner
.Ther
ear
evar
ioust
ypesoft
est
.Each
t
estt
ypeaddr
essesaspeci
fi
ctest
ingr
equi
rement
.

TYPESOFTESTI
NG:
Uni
ttest
ing:
Uni
ttest
ingi
nvol
vest
hedesi
gnoft
estcasest
hatv
ali
dat
ethatt
he
i
nter
nalpr
ogr
am l
ogi
cisf
unct
ioni
ngpr
oper
ly,andt
hatpr
ogr
am i
nput
s
pr
oducev
ali
dout
put
s.Al
ldeci
sionbr
anchesandi
nter
nalcodef
lowshoul
d
bev
ali
dat
ed.I
tist
het
est
ingofi
ndi
vi
dualsof
twar
euni
tsoft
heappl
i
cat
ion
.
iti
sdoneaf
tert
hecompl
eti
onofani
ndi
vi
dualuni
tbef
orei
ntegr
ati
on.Thi
s
i
sast
ruct
uralt
est
ing,t
hatr
eli
esonknowl
edgeofi
tsconst
ruct
ionandi
s
i
nvasi
ve.Uni
ttest
sper
for
m basi
ctest
satcomponentl
evelandt
esta
speci
fi
cbusi
nesspr
ocess,appl
i
cat
ion,and/
orsy
stem conf
igur
ati
on.Uni
t
t
est
s ensur
ethateach uni
que pat
h ofa busi
ness pr
ocess per
for
ms
accur
atel
ytot
hedocument
edspeci
fi
cat
ionsandcont
ainscl
ear
lydef
ined
i
nput
sandexpect
edr
esul
ts.

I
ntegr
ati
ont
est
ing:

I
ntegr
ati
on t
est
s ar
e desi
gned t
o t
est i
ntegr
ated sof
twar
e
component
stodet
ermi
nei
ftheyact
ual
l
yrunasonepr
ogr
am.Test
ingi
s
ev
entdr
ivenandi
smor
econcer
nedwi
tht
hebasi
cout
comeofscr
eensor
f
iel
ds.I
ntegr
ati
ont
est
sdemonst
rat
ethatal
thought
hecomponent
swer
e
i
ndi
vi
dual
l
y sat
isf
act
ion,as shown by successf
ull
y uni
ttest
ing,t
he
combi
nat
ionofcomponent
siscor
rectandconsi
stent
.Int
egr
ati
ont
est
ingi
s
speci
fi
cal
l
y ai
med at exposi
ng t
he pr
obl
ems t
hatar
ise f
rom t
he
combi
nat
ionofcomponent
s.

Funct
ionalt
est
:
Funct
ionalt
est
spr
ovi
de sy
stemat
icdemonst
rat
ionst
hatf
unct
ions
t
est
ed ar
e av
ail
abl
e as speci
fi
ed by t
he busi
ness and t
echni
cal
r
equi
rement
s,sy
stem document
ati
on,
andusermanual
s.

Funct
ional
test
ingi
scent
eredont
hef
oll
owi
ngi
tems:

Val
i
dInput :i
dent
if
iedcl
assesofv
ali
dinputmustbeaccept
ed.
I
nval
i
dInput :
ident
if
iedcl
assesofi
nval
i
dinputmustber
eject
ed.

Funct
ions :
ident
if
iedf
unct
ionsmustbeexer
cised.

Out
put :i
dent
if
iedcl
assesofappl
i
cat
ionout
put
smustbe
exer
cised.

Sy
stems/
Procedur
es:
int
erf
aci
ngsy
stemsorpr
ocedur
esmustbei
nvoked.

Or
gani
zat
ion and pr
epar
ati
on of f
unct
ionalt
est
sisf
ocused on
r
equi
rement
s,keyf
unct
ions,orspeci
alt
estcases.I
naddi
ti
on,sy
stemat
ic
cov
erage per
tai
ning t
oident
if
y Busi
ness pr
ocess f
lows;dat
afi
elds,
pr
edef
inedpr
ocesses,andsuccessi
vepr
ocessesmustbeconsi
der
edf
or
t
est
ing.Bef
oref
unct
ionalt
est
ingi
scompl
ete,
addi
ti
onalt
est
sar
eident
if
ied
andt
heef
fect
ivev
alueofcur
rentt
est
sisdet
ermi
ned.

Sy
stem Test
:
Sy
stem t
est
ing ensur
es t
hatt
he ent
ir
eint
egr
ated sof
twar
e sy
stem
meet
srequi
rement
s.I
ttest
s a conf
igur
ati
on t
o ensur
e known and
pr
edi
ctabl
eresul
ts.Anexampl
eofsy
stem t
est
ing i
stheconf
igur
ati
on
or
ient
ed sy
stem i
ntegr
ati
on t
est
.Sy
stem t
est
ing i
s based on pr
ocess
descr
ipt
ions and f
lows, emphasi
zi
ng pr
e-dr
iven pr
ocess l
i
nks and
i
ntegr
ati
onpoi
nts.

Whi
teBoxTest
ing:
Whi
teBoxTest
ingi
sat
est
ingi
nwhi
chi
nwhi
cht
hesof
twar
etest
er
has knowl
edge oft
he i
nnerwor
kings,st
ruct
ure and l
anguage oft
he
sof
twar
e,oratl
easti
tspur
pose.I
tispur
pose.I
tisusedt
otestar
east
hat
cannotber
eachedf
rom abl
ackboxl
evel
.

Bl
ackBoxTest
ing:
Bl
ackBoxTest
ingi
stest
ingt
hesof
twar
ewi
thoutanyknowl
edgeoft
he
i
nnerwor
kings,
str
uct
ureorl
anguageoft
hemodul
ebei
ngt
est
ed.Bl
ackbox
t
est
s,asmostot
herki
ndsoft
est
s,mustbewr
it
tenf
rom adef
ini
ti
vesour
ce
document
,such as speci
fi
cat
ion orr
equi
rement
s document
,such as
speci
fi
cat
ion orr
equi
rement
s document
.Iti
sat
est
ing i
n whi
ch t
he
sof
twar
eundert
esti
str
eat
ed,
asabl
ackbox.
youcannot“
see”i
ntoi
t.The
t
estpr
ovi
desi
nput
sandr
espondst
oout
put
swi
thoutconsi
der
inghowt
he
sof
twar
ewor
ks.

Uni
tTest
ing:

Uni
ttest
ingi
susual
l
yconduct
edaspar
tofacombi
nedcodeanduni
t
t
estphaseoft
hesof
twar
eli
fecy
cle,al
thoughi
tisnotuncommonf
or
codi
nganduni
ttest
ingt
obeconduct
edast
wodi
sti
nctphases.

Testst
rat
egyandappr
oach
Fi
eldt
est
ingwi
l
lbeper
for
medmanual
l
yandf
unct
ionalt
est
swi
l
lbe
wr
it
teni
ndetai
l
.

Testobj
ect
ives
 Al
lfi
eldent
ri
esmustwor
kpr
oper
ly.
 Pagesmustbeact
ivat
edf
rom t
hei
dent
if
iedl
i
nk.
  Theent
ryscr
een,
messagesandr
esponsesmustnotbedel
ayed.

Feat
urest
obet
est
ed
 Ver
if
ythatt
heent
ri
esar
eoft
hecor
rectf
ormat
 Nodupl
i
cat
eent
ri
esshoul
dbeal
l
owed
 Al
ll
inksshoul
dtaket
heusert
othecor
rectpage.

I
ntegr
ati
onTest
ing:
Sof
twar
eint
egr
ati
ont
est
ingi
sthei
ncr
ement
ali
ntegr
ati
ont
est
ingof
t
wo ormor
eint
egr
ated sof
twar
ecomponent
son asi
ngl
epl
atf
orm t
o
pr
oducef
ail
urescausedbyi
nter
facedef
ect
s.

Thet
askoft
hei
ntegr
ati
ont
esti
sto checkt
hatcomponent
sor
sof
twar
eappl
i
cat
ions,
e.g.component
sinasof
twar
esy
stem or–onest
ep
up–sof
twar
eappl
i
cat
ionsatt
hecompanyl
evel
–int
eractwi
thouter
ror
.

TestResul
ts:

Al
lthet
estcasesment
ionedabov
epassedsuccessf
ull
y.Nodef
ect
s
encount
ered.

Accept
anceTest
ing:
UserAccept
ance Test
ing i
s a cr
it
icalphase ofanypr
ojectand
r
equi
ressi
gni
fi
cantpar
ti
cipat
ionbyt
heenduser
.Ital
soensur
est
hatt
he
sy
stem meet
sthef
unct
ional
requi
rement
s.

TestResul
ts:

Al
lthet
estcasesment
ionedabov
epassedsuccessf
ull
y.Nodef
ect
s
encount
ered.

7.
SAMPLESCREENSHOTS
 8.
CONCLUSI
ON:

Si
nce we are ent eri
ng det ail
s oft he pat
ients elect
roni
cal
lyint he”
Hospit
alManagementSy stem”, datawil
lbesecur ed.Usingthi
sappli
cation
we can ret
rieve patient’
s historywi t
h a single cli
ck.Thus processing
i
nformati
onwi l
lbef aster.Itguaranteesaccuratemai ntenanceofPatient
det
ail
s.Iteasilyr educest hebookkeepi ngtaskand t husreducest he
humaneffortandincr easesaccur acyspeed.
 Bi
bli
ogr
aphy

 www.
googl
e.com 

 ht
tp:
//en.
wiki
pedi
a.or
g/

 www.
w3school
.com

 www.
codi
ngni
njas.
com

 Geeksf
orGeeks