Start Writing from Here

Exlain about qular erpresion and tlow analy enomly deleion

tho The gunetic tlo- cnomaly election problem îit ured to search for a
Speei ie sequnu ot operations considering l posible palhi throuqh out
+ Lt's say the opuratione are sei and ReseT enoted by c and n
to nonnly etetin is used to Cno pautitular sequne occured,
out not to kno the tutal inpat o the procrdure.
*it is und to deteel the bug sequnu fn the following tuokor.
Ale can be opened co), clocdCo), veacdY) or wnHen(w). i Ale ik ead oY
written to ater it ic clogd then it anamolus:
mead), ontkto), veoind ta
2The operahibn prformd by tope transport dvia are
and ctp
fovward Cf). skip k) and ctopcp) .tn tape transport devite neoind
cannot be fortorm one after tht othtr without puform ctop oprahion.
3) with the hp f qenic flow ond anomaly deletion.iti ponible to delect the
Jata Ho wo buqs
ne p9 that occtY onty if too opei afion aand b occered în orde r aba 0r bab
1
 Annotale tath link tht qroph oln Ppropinte oprchn
Hung ThtorLm !
ata-a and
the null opy ator|
cannot be combin d with other oprationt.
operators
Hucnq theorem alco usetul
fn teit deiqn evey epreniGn 0f fotm gm
t4xh for
-thaf t you tubctitute
* Fatht r Huang choor
Data Hlovo Tecting eroampl tollowing tlowqveph can be
operatorc on each link the
ey asigning appropnole
diHerent anomalie bug
uced to deteet

charatler
ctaler that ís cuffitient to detect any to0
Huanq's theovem

dalbtle Jrd Cved ) 0 eYgdnt,u,

Limitations And commpnéc :

i )General'zafions. to cover sequant ol greaker
Huang' thorun
can be catly qunuoliad
A, 8 and c are
nomempty cetr tof cting
Charatkerr ,
(en glh thnn tw0 charaten. and ifT
otone or more
charatter and cenng of k
is a cubt Yhng
sutticient tect for string1 ot lngh k can be obtotncd by cubrtitting
- The
o p*
pk for every appeavanu
p Hpt pr pit-tp

(rplain kv charte and iti peifi cation.

&) catttd into centenue by ucing the tF THEN Fovmo
’The speitications are
’14 a prdicot THeN 4cion
on of mrps
’ kv chart is knoon by evey combinninakon oith any
chart dioqrom
t is uted to
duus boolean 4lqbri manipulation to qraphita
tiuj variable t h i r
the boole an fn of a single
Singk Vaniablf chouor ay
Cquivalent meprernteion a kv Chark
2
 (UGCAutonomoUS)
ESTD : 2002, NAAC (A+)& NBÁ Accredited, Affiliated to JNTUH, A

o The fxn is nver trut

A
The fon
ís true ohtn Ais true
A|0 The frn (s trur ohen Ais
fal te /ohe frn is
Tevo vainble The blow always truz
iagram shouw the 3 of the t6 posible frn o
boo
AB- IAND
A6-A oand note AS -B and 46-A and
KIo7 A

Threc vanable! Kv chartr fo three vaiablu Are choon belbo

AB AB

AB

specitcaion1
Rronte the speihcationz uing contictnt tuminology
|2) (dentity the predicater on ohich the casc! are based name them hoth
Swtable tetterss cueh a1 ABrc
) Re oile tht cpeufhcations fr Gnglich that uees only the togica) Conntetives,
AND. OR, NOT, hoewtyer c tilled 't mny rem.
) convert -the mwrntten peshcations fnto an e cet ot G0alean Gxprevion
5) ldntihy the dfauttaction and caces, if any are speuhrd
c)Enter the boole an Enpretsion in a ku Chart and check for
consickenw
l the speci Hcations are Consickntthie wll be no
overleps, erept for
the cares that uult in muliple actions
1/ en ter the delault caces, and chetk for concitlen y
3) t all above are covere d, the peeiicaion s complele
a) f the specihation is ántomplele or nconsi(lent ,translate th
a

corupondinq boxes of the ku chars batk tnto englih and g

taifheotion Cxplana ion,
to) tf-the default ca e , not speutrd pliitly
ere not trang alte -the
default cates back nto englih and ql aconfimohon
3
 MADTINIe EMAIMECDING C:
Em (o, 9, S6, b, (3,/u)
To find mean tuns
App'y 9421 Rule

(0CAB) And oco)

g427=8+0+0tleq

(3 = 3p
J lhal it stak qroph
J)
e Caplnin ctatk qroph ConcepBe.
slate qraphe The Behaviour of the
cyclm is nepretented in qrphe
form which is knDron a state
-’The state qraph is used for fune tiono! tes ting o
the cyttem to
ídentity ilernt buq it stalt Buq!. Ttranciion Buqu
Contupt.
bstak: A ctah ís a ctatt qroph íc the node which neprerent the charak
-eritthic s and behaviour of the cyctem ctateqraph har cet of ctates ang
they are fdenhfie by characlen. or numberz
Inputs The ctate in the stat qraph contain. ínput valuu to apreent
the changer to the stateeThey can be denottd by nool charattes
Transi Hons: The link thnt joins two stat is known at tranti on
ohen
Come inpuk i pplitd to the node, the ctale chongt nnd -the prouu
ot chanqing of state is knoLoN A tianti ion'"
outpuh Atttr procsing an input, the nult ir produeu ohich a ngon
ckput The input and outpul of the cl at grph ave speralid by thiho
The ctales and input and tranitona in the ctak
rph con be ésplained ay
S’stte stat
pin number
b ’ pin naumbt s ok
’ verificeion of pin /umber 2>sun diploy, two oplions belonu
C pin number ii Oron9
A3’e énte pin
 (UGCAutonornous)

36)
Dleventiete belween go0d ctah qreph and bad
rtab q1oph

Good ctak Groph sad ctat Graph

the elementr of the state tthe ele mentt ot
qaph t-e inputs output. tranti honye not <peufied the stnte qirph
cleaily-thin
are clearly <peeihed nnd thy are ave caid to be bnd ctate thy
easily underr tandnb/e, then thy
ave caid to be qood ctale 9-ph
qood ctatt qrrph wtry ttate tn a bad stoh qrph th srquen
chocul dhave a sequnu of inpotrce of input doc.not luad to tbe
Hhnt drives the cyitem to the ini Hal ctal
storting stne
3-Thtre chould be only one tant'ti More thnn one tangi iont are
cpei hed for one skat and inputpeuified for evcry ctct and inpat
combinntion combina ion
4 There w0uld be only one oukpeat for Therc miqht be none or
cvey tansiion.
more
thon One oukput for vey trontiFsn
Herc buq! ar (tB And th4 areHere buqs are moye And they
eary to find are aiicult to find

4 hat aie coftware ímplkrnnta ion ittee1 in ckale tuing

stat tttinq: The stak teiing ís dtintd ar a faniionrl tertnq to
test the funttionnl bugr in the enire syclem
The pincpla tor ttah tesing it vey cimiler to the prnipks for pib
terting
ror prth Atiting it is not poble to tut eueiy poibk path in a
tlow qroph.
-’ Cimilarly for stak tuing it Dnot potrible to tert for cvey pocribe
path in a ctah qrph
Implmuntation leur !
’The buqt ín the coftware ilesnt caus
Can 0ccur
through mny
’ Our to there buqs it it ímpbrsible tn ctat
to cover l th pathc
 due to
The bug! mny oc(ut
-+ lncoyrect number of stater
+ Inconect Ctaler trangiions
+ Intorrect tranti ion output
Dead ctater
Cunveathnble clales
crongly conntcted qroph
’ The oc curanu ol bug will be more in
-’ when the syrtm hai no slate nnd hn theie are impope
vesponiti, the clak iagram1 a rot pplit d
eath and every thínq is clealy gpecihed cuth as trantion
-ohen
and outpub tor each ctae ínput com binntibn, il would be casy to
state tering is contiderrd ar bottom line melhod ai at suppor k
fune tional mode yather than the strutturo etaila

3 (-plain about parfition ing algoritbm.

This algoithn is uted to converl or traniform the qroph having (oop:
into toop free or paitly ordered qiaphu
t procr
prot of conversion ir done by qiougíng the noder fn cuch a
Th
that the foops are prsent
present in
in one or othe r 9roup
HThe matix thot is ured by thi alqonthn ic (p)9 t (p)",
whtre p ít a qraph motik Ti iden tity n bi, ttye t npreenh the
cont atenntion, of motiu
+The mabix helpt in qrouping the oder ínto teh. tt meant loop free
9roph
+ The raalix bnlysi done on the paitty Ordred qraph that ii obtains
trom parhtioning algqoritbm
-+ ohere there ic a toop. break the loop and con inue the prot J
’ In simple, the alqoithm Can be
exploined diulding
a cUe are
the qroph into numbr of group! cuth tht , eath toop
be felling into cattqoy of one othtr qroup. then the loop
oill
6
be rove d and complete qroph it obiaintd by Concole nn ing
 ESTD NOH I0m
ARIIA Ranked. A
a AiCTE NIIDE R

the qroufps alerremouing the toopr

Sb Gxplain about Node Reduttion algoitbm.

emove the
it i a cequene of cleps thal are follb wed in order to
intermdiate nodes

ctepc
’ Any one node chould be cele che d and it shold be qemoved by
neploting the équelent tink1
+ I! thert are parallel temi, cimplihy them by adding
tdunbty -tht -ttimt oith sil!(oopr and the outlink of the (09pr
Should be adjuted to ad d the efe cke d ol celt loop tum.
+ohen all tht above slepr aie prtont d tht tide siz ot the rttaltont
metin could be neduce d by i
d
7 This proe u choul d be pertormd ntl only two no de t are remain
in the qraph
As we ne dueingtht qiaph mrtit,
prior to ctarting of proudure th: qph
Choeul d be conveukg to matri
A

A
)(n ordur to rmove any node the elt toop
at node ha to be removed ttà qem ved
by jutting the ink panìng out hrom
the node oith the eflect of (oop. The
R
mbix it obtaincd by
combining

4Yaph mnti that has to be

7
 The self loop i emove d by mplaun9
vnnd t
A
the in kt

araph atter mmoving sell loop

Vot

B4 comoing the tems the no de

have ben nemovediThe a
n orde
wt |ar-p
SXS becomi r y Th cx of the mamx lter

’Thecle -for clt loops fn the quulkd mmtx tf there are any cell toops
Lollo0 As thrc are no Aiogonr elemnt theie cre no rel f (oops. to th
nert step as to nemove nodi D
A

A
Thtre is a diogonrl element lt Impliy
that thre is a self loop and i should be
nemoved a already Jone fn clepO
9uw The myultant mabix after movlng
Cell CoupP. 00ud be at in anbove fir
mabi n after remoual of nodt(D
The myultant mtnn 3xs mnlx

quwrL)+
|(s4q1tquwrv)
matix altremovnl of set toop
Ooo there it only ont node to remove te c blw tntby and Grit
node afler Cimpltsimplikying nd qmoulng node c
The termm will bt P(quw*t) (tqrtqwt)
8
The path xpreuion from node to B)