Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.
EB ?* H      l E tea    slqe HgE I- H -6I       E               EEeEiE i€,iEr               g"sgE**E ? 5 E? E    o        ...
e-?E-                   4. trv                        _;                              6A6 eda?-                           ...
f                                                                                              REG NO:                    ...
ii)    Wirl   * example, perform the operations of an insertion and a deletion                                            ...
Upcoming SlideShare
Loading in …5

Advanced data structures and algorithms


Published on

Advanced Data Structures are concepts are dealt in detailed fashion

Published in: Education
  • Be the first to comment

Advanced data structures and algorithms

  1. 1. EB ?* H l E tea slqe HgE I- H -6I E EEeEiE i€,iEr g"sgE**E ? 5 E? E o 3 E s"; -"b c;-Fdd : =
  2. 2. e-?E- 4. trv _; 6A6 eda?- =- ? E g€ € € e8 €E+. .cG.E ^. sii E u 6 o E& A!€-r € ?s ; fr is €SEE g Erg - 9. iI g€gg >,d c Er: ! .E e tr d n g$ E vi .eT 3E= o tg -i ;r -= ov o I + 3ZB !k €39 o g oj @ € .S 5 ? ll b € e?qE E ;fr €:r a srd I : € f5!SEEiEt qgE Eai-€s E f?sggii3aE+E f€* e;3 ;eEit E euE ;gf € i ;gAi tsts i€r$ u *ci E;E*F9;- i*ta H:€ii*! .t t c$FE €iEr IE€E E :: + €i: l ffi E*ii€flsi$H* aIFF TECS Efri iir$ ;tE:sr€ t 5 E - { :- 5€+*ie*oEH,sE t;Y*sE€€ii{i.,rlrt1:, =)4{+aln q --; E€$s E;m$3ti ...: :i ,: :) :i E .; 3 38<cri d€S€ ad U ,a ri - * osgg o€ o:eoE @g +o Eo Eg = -EEF5F 6r @ "€7*qe ft58E B€e€3 €q B 3.9r -ia €xgc € +f €-E -oP o F d .x ii 4 .s t a i n :e 8€ $.- j1 1;; EA6N1 ts gE; e. E.; g !€ ..5 s: E N E c{ :i c.i *!: O^^s :E ^ E g EE $ c.i .E q Fr+i€-i <.i E €€s g sE- 8 tg r:d o_ oN L g o}| € ,,-lEs B *.rE E $3 E 3 ;s ; a;t :; g$ ; e b0diA q{o E^.4 j tt;€u* s i€;ca i! -do> #6s*.ts € o 8: s:s;SiigEeiECE s c.i Ffo o 6 r*€ gf; 3 EE I t;r .! o:.d E! E $ E+ a* i €E { l E: { ; €! K qEs g:-EiE ri o t H to EE €TE trg8 *i=E?. H 66_- a"o ;EEs g€ 3;i [EE = o sE:f;€ a it o :t $98,.- i:g el ;E il o.! 9 -E €Z E :B EE= E€ €;€ E: HH ! o g? ;E3i fr3E ;:I tr r AO E3 E qE 33 6 E ;EE o d o () :a .; :i ; .i I d p d ci ci
  3. 3. f REG NO: University Departments: Anna Universify, Chennai M.E (FT) Degree Examination, Muy Z0IZ -ZA Semester I - (Regulation 2009) Branch : Computer Science and Engineering CP 91T2 ADVANCED DATA STRUCTURES AND ALGORITHMS Time : 3 hrs Answer all questions Max Marlis:l00 PartA(10x2=2Dmarks) 1. Define NP hard and NP complete problems and provide relation between them. 2. Prove by contradiction: log(3) is irrational. ..!. .. tt 1 3. Solve the recurrence relation : T(n) :3 T(n/2)+ c.n, given n is a power of 2 and c is a positive constant. 4. what is an AVL tree? what is its maximum height for n nodes ? 5. Define Trie data structure 6. What is special about Leftist tree? 7. Write down the properties of Deap data structure 8. State an application of counting binary tree 9. Draw a k-D tree where k:l 10. Explain stabbing query Part B ( 5x 16 = 80 marks) 17 a. Perform detailed amortized analysis over the sequence of operations for l0 generating the first 9 subsets ov€r a binary set of elements. 6 b. State the properties of Big Oh notation 12. a. i) State if Splay tree is amortized data structure Explain procedure for insertion and deletion of nodes in the splay tree with ii) an example. 10 (oR) b.i) State the properties of Red black tree
  4. 4. ii) Wirl * example, perform the operations of an insertion and a deletion on a red black tree that makes the tree unbalanced and resolve the imbalance. 10 13 a i) Define binomial heap and explain the operations of insertion deletion with an example 10 ii) Explain why lazy binomial heap is called so? 6 (oR) b. ii) Explain melding ofpriority queues ii) Write algorithms for insertion and deletion operations in a Fibonacci Heap and explain with an example l0 14 a i) Explain a divide and conquer based algorithm for finding the convex hull over a set of n points. What is the time complexity of tf,g algorithm? 12 ii) Define deterministic and non deterministic algorithms 4 €:) (oR) b. i) What is a randomized algorithm? 4 ii) State the tree Vertex splitting problem and explain the algorithm to solve t2 the problem and analyze its time complexity15. a. f)efine ID( - quad lree and explain the basic operations of insertion, deletion and querying t6 (oR) b. Define segment tree with n points and explain the querying operation with an example and evaluate the query time t6