DATE
I0.09.2025
Pxoces Hannqunent
Psuoces
states
Hulliple
Teuninate
e
.c a,out CPU
(eneeuting
preguam)
Acive Enty
wsing a compe, we get an |• when we eeeute a ogum, it beomes aA
enuAutubll ue a.0uu.
entity
becaat it is
net ntevptng
unit NONK whh iu dane by a cPu s Ge ees measoed by a pocens
TFex QM muupla staies apoCL.
B. out (eNeU able le)
Heeeatedaeyep Bo oxln o shx pegxnm. dhe cRU mst teninah
iu cwwunt stote
•Thead Jhe smallt wnit o
is a poces hich can be enecuted
Add by a cPU.
Shones Wih one C puogwam,we can execule mulliple proses.
the same
Hul
data •Heap u a data sbucwe which alows
dynamie mamany
aloaiom.
a,c a
weth
• A peccn ho a ctack Hponkaluen ú chao ihecodh.
whieh
Suppoae we ave ticalaseu
u odduuion aud wwltplicotom Stack stack contains temporay data e puneti ons
pocms can oocu.
SUwe heap tuap is dynamic nnay alilied
Add
data Cont uin he ghab al vaui abs and die
tet JeN Judl uNalank hi
• Consid she inpu nn by a eliinl a s stoed n the tut setiampxogun
(a,b). Ths inpul shand
u by both he
pocss. tank peaum
WhaeepOCn d eARulien, ik la stoud n 1hu RAM
, DHIE
• When he stack nd heap aMe WOUnlu d the peunt wna tu aOWA KLach a middle
point and he progam seps
• whan we ae stoung he state of a pUquam, U stoxing e ndiie ctak.(puoces)
Daimorv-kondl lael pHGgxoumu hat stavt whun dh boetloadax StakA. \ie lponaoL
fex xumoving some pot q ihe data puoent in stack.
tales e a Poces:
gno au Jhe bt
New (ue oaded into he
UN Stal,ilgcut Rendy
MAm.
Inuial state
the uady state
a nuwly cuated 1 gu (foliaus pueped trro
pogan The Neady stat haldi a queue
wnU HU dn enpy sle
n Jhe qwue, the prgm goes thue.
the nw
wll go
state
to
'Jn the MLod state, whn al h
eOmpualuonaJuusb ueeA,
memery cuwailabili by, data awalabiliy cnd oth e0weeee
•CPUeetes a to erueite he puoce ane awailable, il gos to the wnning
sta
Aial mann.
Running TeAninAted
•fom the Ainnng state, t gos to the teumiated etate
whun
waitrg
a pognam neds
Lett
it
say Jh Hap may
cuatis a stwane Lnkevupt to heicate
uull wtn unwng hupegAm
tha te puogram
.
cant centnue ids exuatiom Jn oaot on unupt, ges
an iput
hu waiti stat Aax
gets the Lnput
it neds
t goc
.gos to
back
back to the stab
to nady otab
piag duypateh
Imp 6chedules
adnu tted
New Runnig Teminaud
Intovupts
o Waik
completim
, Cna PO
- Loadthe os Knel to the memoy and statemeRuen
yetum
Pocs Contet Bleck - PCB (TOB:Tack conisl Blek) M
upuoents hew on yLws a pASCRDS
PL ?2
osS
Paocs 2
Tdontiti dnifies he poesto be eucuted
State ctala a poCRA uing puebabilty
Psucoiky
pogam
Pegam Counten
ndicatus the add% e nunt intucien
pounds do mumeny ocai on
Hemoy Pouex
Contt data -> fousu om tanew sWdeh (Sawing he stat oy a puscus and
To Stak
Aco
da eUuuon bma.
Menay MAyCnunk i we e swng weh ble, tan he whoabon wil be stared hene
Bae nugtr
I0.09.2025
Pxoces Hannqunent
Psuoces
states
Hulliple
Teuninate
e
.c a,out CPU
(eneeuting
preguam)
Acive Enty
wsing a compe, we get an |• when we eeeute a ogum, it beomes aA
enuAutubll ue a.0uu.
entity
becaat it is
net ntevptng
unit NONK whh iu dane by a cPu s Ge ees measoed by a pocens
TFex QM muupla staies apoCL.
B. out (eNeU able le)
Heeeatedaeyep Bo oxln o shx pegxnm. dhe cRU mst teninah
iu cwwunt stote
•Thead Jhe smallt wnit o
is a poces hich can be enecuted
Add by a cPU.
Shones Wih one C puogwam,we can execule mulliple proses.
the same
Hul
data •Heap u a data sbucwe which alows
dynamie mamany
aloaiom.
a,c a
weth
• A peccn ho a ctack Hponkaluen ú chao ihecodh.
whieh
Suppoae we ave ticalaseu
u odduuion aud wwltplicotom Stack stack contains temporay data e puneti ons
pocms can oocu.
SUwe heap tuap is dynamic nnay alilied
Add
data Cont uin he ghab al vaui abs and die
tet JeN Judl uNalank hi
• Consid she inpu nn by a eliinl a s stoed n the tut setiampxogun
(a,b). Ths inpul shand
u by both he
pocss. tank peaum
WhaeepOCn d eARulien, ik la stoud n 1hu RAM
, DHIE
• When he stack nd heap aMe WOUnlu d the peunt wna tu aOWA KLach a middle
point and he progam seps
• whan we ae stoung he state of a pUquam, U stoxing e ndiie ctak.(puoces)
Daimorv-kondl lael pHGgxoumu hat stavt whun dh boetloadax StakA. \ie lponaoL
fex xumoving some pot q ihe data puoent in stack.
tales e a Poces:
gno au Jhe bt
New (ue oaded into he
UN Stal,ilgcut Rendy
MAm.
Inuial state
the uady state
a nuwly cuated 1 gu (foliaus pueped trro
pogan The Neady stat haldi a queue
wnU HU dn enpy sle
n Jhe qwue, the prgm goes thue.
the nw
wll go
state
to
'Jn the MLod state, whn al h
eOmpualuonaJuusb ueeA,
memery cuwailabili by, data awalabiliy cnd oth e0weeee
•CPUeetes a to erueite he puoce ane awailable, il gos to the wnning
sta
Aial mann.
Running TeAninAted
•fom the Ainnng state, t gos to the teumiated etate
whun
waitrg
a pognam neds
Lett
it
say Jh Hap may
cuatis a stwane Lnkevupt to heicate
uull wtn unwng hupegAm
tha te puogram
.
cant centnue ids exuatiom Jn oaot on unupt, ges
an iput
hu waiti stat Aax
gets the Lnput
it neds
t goc
.gos to
back
back to the stab
to nady otab
piag duypateh
Imp 6chedules
adnu tted
New Runnig Teminaud
Intovupts
o Waik
completim
, Cna PO
- Loadthe os Knel to the memoy and statemeRuen
yetum
Pocs Contet Bleck - PCB (TOB:Tack conisl Blek) M
upuoents hew on yLws a pASCRDS
PL ?2
osS
Paocs 2
Tdontiti dnifies he poesto be eucuted
State ctala a poCRA uing puebabilty
Psucoiky
pogam
Pegam Counten
ndicatus the add% e nunt intucien
pounds do mumeny ocai on
Hemoy Pouex
Contt data -> fousu om tanew sWdeh (Sawing he stat oy a puscus and
To Stak
Aco
da eUuuon bma.
Menay MAyCnunk i we e swng weh ble, tan he whoabon wil be stared hene
Bae nugtr
