UNIT -1: LINEAR STRUCTURES: LIST: 1. 2. &. *. +. ,. /. 0. Differentiate between arrays and links. State t e ad!

anta"es #f $ir$%lar lists #!er d#%bly linked list. E'(lain #w (#inters are %sed t# i)(le)ent linked list str%$t%res. E'(lain !ari#%s #(erati#ns (erf#r)ed #n t e d#%bly linked list. E'(lain t e inserti#n and t e deleti#n #(erati#n in d#%bly linked list. - at is a linked list. - at are t e ad!anta"es #f d#%bly linked list #!er sin"ly linked list. Desi"n an al"#rit ) $alled RE1ERSE t# re!erse t e linked list. Tra$e y#%r al"#rit ) wit y#%r e'a)(le. 2. -rite al"#rit )s t# C#%nt t e n%)ber #f n#des in t e sin"ly linked list Re!erse t e sin"ly linked list C#n$atenate tw# sin"ly linked list C#(y #ne sin"ly linked list t# an#t er. 13. -rite ADT #(erati#ns f#r array i)(le)entati#n #f (#lyn#)ial additi#n. 11. -rite a (r#"ra) in C t# ret%rn t e (#siti#n #f t e ele)ent 4 in a list L. 12. - y is linked list %sed f#r (#lyn#)ial arit )eti$. 1&. -rite s%itable ADT #(erati#ns t# (erf#r) inserti#n and deleti#n in a d#%bly linked list. 1*. - at is a linked list. E'(lain wit s%itable (r#"ra) se")ents t e #(erati#ns #f a linked list. 1+. -rite briefly ab#%t d#%bly linked list and $ir$%lar linked list. STAC5: 1,. 6i!e a((li$ati#ns #f sta$k and "i!e e'a)(le f#r #ne #f t e). 7r - at are t e %ses #f sta$k. 1/. 6i!e linked list i)(le)entati#n #f sta$k #(erati#n. 10. - at is a sta$k. E'(lain any tw# #(erati#ns (erf#r)ed #n a sta$k wit re8%ired al"#rit )s. 12. Define an effi$ient re(resentati#ns #f tw# sta$k in a "i!en area #f )e)#ry wit N w#rds and e'(lain. 23. -it e'a)(les e'(lain #w a sta$k $an be %sed t# $#n!ert an infi' e'(ressi#n t# a (#stfi' e'(ressi#n. 21. Usin" linked list9 f#r)%late se(arate r#%tines t# $reate an e)(ty sta$k and t# (%s an ele)ent #nt# a sta$k. 22. E'(lain t e ADT #(erati#ns f#r array i)(le)entati#n #f sta$k. 2&. :#w d# y#% (%s and (#( ele)ents in a linked sta$k. 2*. 6i!e t e $ ara$ter re(resentati#n #f a inte"er9 $#n!ert it t# a $#n!enti#nal de$i)al f#r)at.

2+. ;#r)%late an al"#rit ) t# $#n!ert a de$i)al inte"er t# its $#rres(#ndin" #$tal re(resentati#n. 2,. -rite a (r#"ra) in C t# $#n!ert an e)(ty sta$k and (%s an ele)ent int# it. 2/. List t e $ ara$teristi$s #f sta$ks. 20. -rite t e r#le #f sta$k in f%n$ti#n $all. 22. -rite r#%tines t# insert eter#"ene#%s data int# list. &3. :#w w#%ld y#% i)(le)ent a sta$k #f 8%e%es. -rite r#%tines f#r $reati#n and insertin" #f ele)ents int# it. &1. - at is re$%rsi#n. E'(lain wit an e'a)(le. &2. C#n!ert t e f#ll#win" infi' e'(ressi#n int# (refi' and (#stfi' e'(ressi#n. a<b-$-d=$<f-"> <i &&. -rite s%itable C r#%tine t# re)#!e and ret%rn t#( ele)ent #f t e sta$k %sin" array i)(le)entati#n. &*. -rite in detail ab#%t any t ree a((li$ati#ns #f sta$k. ?UEUE: &+. - at is a (%r(#se #f )%lti(le 8%e%e. &,. - at is a si"nifi$an$e #f (ri#rity 8%e%e. &/. -rite an ADT f#r 8%e%e. &0. A $ir$%lar ?9 t e si@e #f w i$ is + as t ree ele)ents 239 *3 and ,3 w ere fr#ntA3 and rearA2. S #w wit ne$essary dia"ra)s w at is t e !al%e #f fr#nt and rear after ea$ #f t ese #(erati#n. iB insert ite) +3 iiB insert ite) 13 iiiB insert ite) &3 i!B delete an ite) !B delete an ite) &2. :#w $ir$%lar 8%e%e is ad!anta"e#%s #!er se8%ential 8%e%e. E'(lain wit an e'a)(le. &2. 6i!e array re(resentati#n and i)(le)entati#n #f $ir$%lar 8%e%e. *3. - at are t e !ari#%s #(erati#ns t at $an be (erf#r)ed #n sta$k and 8%e%es. E'(lain t e al"#rit ) f#r ea$ wit an e'a)(le. *1. - at is 8%e%e. -rite al"#rit ). E'(lain ab#%t t e !ari#%s #(erati#ns (erf#r)ed #n 8%e%e. *2. List few a((li$ati#ns #f 8%e%e. *&. Dis$%ss in brief ab#%t t e array i)(le)entati#n #f 8%e%e. **. E'(lain t e (ri#rity 8%e%e i)(le)entati#n. -rite a ne$essary al"#rit )s. *+. -rite ADT #(erati#n f#r array i)(le)entati#n #f 8%e%e. 7r E'(lain #w 8%e%es $an be i)(le)ented %sin" arrays. *,. -rite a r#%tines f#r insertin" and deletin" ele)ents fr#) a 8%e%e. C e$k f#r t e $#nditi#ns ?e)(ty and ? f%ll. */. -rite s%itable r#%tines t# (erf#r) inserti#n and deleti#n #(erati#ns in linked 8%e%e.

UNIT -2: TREE STRUCTURES: 1. 2. &. *. 6i!e !ari#%s i)(le)entati#n #f tree. 6i!e and e'(lain t e !ari#%s tree tra!ersal al"#rit )s wit e'a)(le. Define binary tree. E'(lain ab#%t binary trees and $reate a binary tree f#r t e f#ll#win" e'(ressi#n. CCd<e=fB<"B +. 6i!e an al"#rit ) f#r sear$ in" binary sear$ tree. 7r -rite al"#rit ) t# l#$ate an ele)ent fr#) binary sear$ tree. ,. Des$ribe briefly ab#%t t e !ari#%s tree tra!ersal. /. Define $#)(lete binary tree. 0. :#w is binary tree re(resented %sin" an array. 6i!e an e'a)(le. 2. Draw a binary sear$ tree f#r t e f#ll#win" in(%t list9 ,39 2+9/+9+39 1+9 ,,9 &&9 **. Tra$e t e al"#rit ) t# delete t e n#des 2+9 /+9 ** fr#) t e tree. 13. C#nstr%$t an e'(ressi#n tree f#r t e e'(ressi#n A=CD=CB<D<CE=;B 11. Define binary sear$ tree. 12. -rite t e r#%tines t# insert and re)#!e a n#de fr#) binary sear$ tree. 1&. A f%ll n#de is a n#de wit tw# $ ildren. Er#!e t at t e n%)ber #f f%ll n#des (l%s #ne is e8%al t# t e n%)ber #f lea!es in a binary tree. 1*. -rite inserti#n al"#rit ) f#r A1L tree. -rite s%itable r#tati#n al"#rit )s. 1+. -rite f%n$ti#n t# delete t e )ini)%) ele)ent fr#) a binary ea(. 1,. - at is t e )ini)%) n%)ber #f n#des in an A1L tree #f ei" t +. 1/. S #w t e res%lt t e insertin" 2919*9+929&9,9/ int# an e)(ty A1l tree. 10. -rite t e (r#$ed%res t# i)(le)ent sin"le and d#%ble r#tati#ns w ile insertin" n#des in an A1L tree. 12. E'(lain wit s%itable e'a)(les t e basi$ ea( #(erati#ns and write al"#rit )s f#r t e sa)e. 23. - at is t e %sed #f sentinel !al%e in binary ea(. 21. -rite ADT #(erati#ns f#r ea( s#rt. Usin" t e ab#!e al"#rit )s9 s#rt t e f#ll#win": &*9*+92+9119,90+91/9&+. 22. S#rt &919*919+92929, in de$reasin" #rder %sin" ea( s#rt. 2&. -rite ADT #(erati#ns f#r :ea( s#rt. Als# si)%late t e f#ll#win" n%)bers %sin" ea( s#rt. - at is t e ti)e $#)(le'ity. &+9 *+9 2+9 119 ,9 0+9 1/9 &09 1329 1/0 2*. E'(lain in detail ab#%t binary ea(. 2+. - at is an A1L tree. 2,. E'(lain ab#%t r#tati#ns #f A1L tree. UNIT-&: :AS:IN6 AND SETS: 1. C#)(are t e al"#rit ) f#r linear sear$ 9 binary sear$ and as in" te$ ni8%e.

2. &. *. +.

List #%t !ari#%s te$ ni8%es #f as in". - at is as in". E'(lain in detail t e linear (r#bin" te$ ni8%e. :#w will y#% res#l!e t e $#llisi#ns9 w ile insertin" t e ele)ents int# t e as table %sin" se(arate $ ainin" and linear (r#bin". -rite t e r#%tine f#r insertin"9 sear$ in" and re)#!in" ele)ents fr#) t e as table %sin" t e ab#!e )enti#ned te$ ni8%es.

UNIT-*: 6RAE:S: 1. 2. &. *. +. Define a "ra( . E'(lain t e (ri)Fs al"#rit ) t# find )ini)%) s(annin" tree #f a "ra( . - at are t e st#ra"e re(resentati#n #f a "ra( . - at are t e a((li$ati#ns #f "ra( . Define NE $#)(lete (r#ble)s. 7r - at are NE- $#)(lete (r#ble)s. 6i!e an e'a)(le. ,. - at are str#n"ly $#nne$ted $#)(#nents. E'(lain. /. ;#r t e "ra( "i!en bel#w $#nstr%$t a )ini)%) s(annin" tree %sin" (ri)Fs al"#rit ). S #w t e table $reated d%rin" ea$ (ass #f t e al"#rit ). 11-G!2A2H!*-G!,A0H!*-G!/A*H!+-G!/A,H!,-G!/A1H 11-G!&A*H !1-G!*A1H!2-G!*A&H!2-G!+A13H!&-G!*A2H!*-G!+A/H!&-G!,A+H

1 1

1 2

1 &

1 *

1 +

1 ,

1 /

0. E'(lain D;S and D;S in detail.-rite t e al"#rit ). 2. E'(lain (ri)Fs al"#rit ) wit an e'a)(le. 13. E'(lain t e t#(#l#"i$al s#rtin" al"#rit )

11. -rite ADT r#%tine f#r D;S al"#rit ). 12. Define NE ard and NE- $#)(lete 1&. -rite ADT #(erati#n f#r (ri)Fs al"#rit ). 1*. E'(lain DiIikstraFs al"#rit ) %sin" t e f#ll#win" "ra( . ;ind t e s #rtest (at between !1 t# !29!&9!*9!+9!,9!/. 11-G!2A2H!&-G!1A*H!1-G!*A1H!2-G!*A&H!2-G!+A13H!*-G!&A2H!*-G!+A2H 1,-G!&A+H!*-G!,A0H!*-G!/A*H!+-G!/A,H!/-G!,A1H

1 1

1 2

1 &

1 *

1 +

1 ,

1 /

1+. Er#!e t at t e n%)ber #f #dd de"ree !erti$es in a $#nne$ted s #%ld be e!en. 1,. - at is adIa$en$y list..- en it is %sed. 1/. -rite s #rt n#tes #n bi$#nne$ti!ity. 10. - at is an a$ti!ity n#de "ra( . 12. ;#r)%late an al"#rit ) t# find t e s #rtest (at %sin" diIikstraFs al"#rit ). 23. Define a "ra( . :#w it differs fr#) tree. 21. - at is )ini)%) s(annin" tree.Na)e any tw# al"#rit ) %sed t# find JST. 22. -rite an al"#rit ) t# find t e )ini)%) $#st s(annin" tree #f an wei" ted %ndire$ted "ra( . 2&. - at is sin"le s#%r$e s #rtest (at (r#ble). Dis$%ss DiIikstraFs sin"le s#%r$e s #rtest (at al"#rit ) wit an e'a)(le. 2*. ;ind JST f#r t e f#ll#win" "ra( . A-GDA+HA-GCA*HA-GDA&HD-GCA2HD-G;A&HC-G;A11HC-GEA1H;-GEA&H D-GEA*H

UNIT K +: AL67RIT:J DESI6N AND ANALLSIS: 1. - y d# we say 8%i$k s#rt is an %nstable s#rtin" )et #d. -rite an al"#rit ) t# (r#!e t e sa)e. 2. De!i$e an al"#rit ) f#r an inserti#n s#rt. &. 6i!e e'a)(les #f s#rtin" te$ ni8%es t at is n#t based #n di!ide and $#n8%er al"#rit )i$ te$ ni8%e. *. - at is t e best $ase and w#rst $ase $#)(le'ity #f )er"e s#rt. +. S#rt t e f#ll#win" ele)ents %sin" ea( s#rt 2+9++9*,9&+91392390*9&1. ,. E'(lain )er"e s#rt in detail wit s%itable e'a)(les and (r#(er ADT #(erati#ns.