ssi Gr)ENT

SHI BHIRAJ. V
TaTTQEVECITO
ECE - C
 bond Sahatis

heap pupasty ap
geater fhan or
han

its nods The peinay prpor i

is to
(raintaio nooes The

maintaio

VA
Biray Min- Hsep:
binng max- hea p, Hhe
hode
hild
eleen
 at Hhe

min-heap,
the vahe each paant
than to Hae Valmes
cluild nodes enyws
iaim elennont alway at the ot

Heap V3
odinony Binany Toe
Suchu: A Conmplole biy
al) levels exapt
the last Jally siled .and
tat Hlled
Contast n
hae
|/ and no ules

hod placmnt
|Opertions leaps
e clenent maing them
m
 mahatly CompaMe acivihu.
gamic
the
pprod,
iovolues sle dig Hhe
adivihy
eaulist Hioiah a encd
ard often yidd
ophimal slaio tox the activiy Seleti
-

|anamie
Can
Pgarmmgi prgeainiy
achviky sele tioo
al Pesible
eutsehs ativibs Howeve it ay
nat be ztüent
Jor this

Imptane
ines

aloes fos
achvies
ith
achviy that fioises eariest, it be cones
 eas ie
detesine actihe
Can be peo fonneJ
Appicátino
Htatonan is widdy wed in
data Coupresleo duch as in

age and
stor aqe to
preent data
7asigning vaiable
Codes
-lngio chara cteu based on

Tmpontane Solving Tsp opimaly

Do al wold
applicati'sns such
Logishs, navig tieon ,ond nanufachwy
the opimal slution to to
Saleman Proldem (Tsp) Can
Todncs Ces ts Hone and
hesores Howe an
Np -
thatd pacble and
giodig the
 Sdudio bocomes iscv easingy
as nunbet ahes

9 Pedahons and Combio aiens

pinetations Peret atins oter to tae

ananqinent objects
polutatow asase
to
andtyis
andyze te tione

pomalhng
algus?ltinus
elenents

Combinatiane: Combio ati ons efe t Hae Seleehn

wtoeb (onsi donig theis ode nt'no.
algi Gm analysik far faske
Janen ating dubsehs edeonante
el ing Sebject scts elomenti that
Saba ty erta'n Gitesta
 Tnplenant atien poiihy
#induda iesteam>
tncde <vecta)
sing namuspace std
dass Pionity Quene i
pzivate:
Voctsn <int> heap;
Void teap:fy (iat index)f

int panl (index)/2)

Suop (haap lpaunt), haap ndes)i

tnder þaunt
break

Vetd heapifg Doan (iat inder)t

Size ()j
 int leffcaild inder t
xiglt chitd : 2 jndex 42;
max Jodex =tndex;

eap fnar Doder)

mor Snde x - lettchi ld

heap[moxtrdex])
3

Swap (heap Chd exJ, heap ror Indo),

ndex mar hodex;

broat)

Þublic :
Veid iut Cint valuelr
 Weop push back vale);
heapijyOp(heap *iz)-):
0at deleleMax ()

HChap.enplyt
Cout e"prienty queu is ermpty ku!

to mar Vae
tuopsJ:
heaploj haap bt):
heap pop -back)
hapity pDoun (os
Tehun mar Vaue
3

aondt
3

3
Nehun
taplo].
any
Void dijxatha (recor voopa'ntid int s
Sosce)
int
Vechx it dit (n, IvT MAx);
20)

psiony-ane <pais int int> Vea<pai

id int, qroater <pais <iat, at » :
P puh (o, Sou 3)s
uile (lPervpty )1
ae cond;
P Papl0;

int
weiglt cdge secod

diat [v : dist lu) + helghti

Py
pusa ({dist vI,v});
ral
( laut Eopvewnlale:
attoibtes a

Aexoiploo tcam mermben

slanl and end dates
piity and
dependencies other Lars

Nundony Managomat Tasks can hauu

dependenies olhe fay k
pcsente divx dhed edqes he
lhat
Complenled he Cornet
bayed
depand ancia
Visancli %ati on:
rovides 'a vibal)
bepsentati oo he
poojeche tascs dnd
Iheiy
depundenies beoy to
cacly undensand sthuctu and
indeni y depndni
Sihedulig and
toact vacki
theirg
leam (an Scedle

depandon cies prjet.

Conpeted and loitain budgot
 (
Aletts and Notiticatian 4'
Send aleshs and notiftcati ors t team
Menbers about doadires ,carges în
( tastk
tauk dependoncia aelay
Rescuce A
locati on : Te
idenhify?s
oltase
locating deperdenies jiientyTesOUrce Constalo
and
teans to optioiza
)

olleunig diferent tasts

Usage
and Analyta : Te Sys bern provla
Reortig
repants an analyis project pogess,
tast Conmp) ehien vats, Tesoce uizátibo.
uhlizatron
and ajbeal path analysi Ao help team
mako data - diven decsions and iod
Paojed manaqemenl PooCeses
N-Quccn is a
dasca Comboational
In chesshnd dangcment.Tie
thjechea s to place N qeerns an
 fad lask
Tak Repveacnlafte
attaibute

desoiphoo ax iqoad cam harmbes

end dates
stant and
paiih and
deperd encies oher taks

Dopundon y Managementi Tasks can ha

depordenies
epaesarted dive ded
esw that
Complened Conet
bayed depund onciu
Visuali xati on: The
Yovi des 'a visa)
the tas dnd
thei depundenis
aleuing bearng to
eanly undesand stuchue and
indeni y Cihed þath tependarus
Shudadling and leam lan Schede
act their
depadancie enwe a
pojeut,
Coupetd and
 Alenbs and Notijicatio) 4:
Send aleshs and noifto ati ons to teorr
nennbers abut deadlines ,haga
task dependencia delays ( tazt

Compl etion
Rescuce Al}location: Te Sstern helps in

task dependonieu and UsUrCe Constatot

) teams to optioize
acoos3 diferert tasts

Reçortig and Analyts: Tke Sys bem provh

2eports and aralyhies project prrgess,
rates esooe ulizatin
tast Comp) eho
and coical path analysis to help tram
mako data daiven decisos and iopoe
pagj e manaqement PoCeses
(4 N-Quccn dasiea Combatonal
Prebern cheshavd arangennent . ie
The

objeckhue plae N qeers an

 chessbod such a trat no tuo
qucans atta ck eah o t :
Can move
honizontallyg Vert ically dagonty
and t s tuo qecayrs ottack each othor i
sha te aame

dor

USng nanespte std :

Vetd dislay (nt matshj at )
o Got i-0, iN;i++) Coat2endl )

Coutenl

beot check(int mat [izlsNz6],int N, latazo, nt Ca)

tj (mat [iJ[ce] ==t)

Dotn tal se 3