Sa Paper / Subject Code: 51403 / Data Structures and Analysis st|at| seman] cBcs af mew te ae (@ Hours) {Total Marks: 80] q NB.: (1) Question No.1 is compulsory. (2) Attempt any three out of remaining questions. (3) Assume Suitable data if necessary. (4) Figures to the right indicate full marks. 1. (@_Explain different types of queues in data stnictures, + (b) How does binary search different from linear search? ) 3 (©) Explain Doubly Linked List. 3 i @ Define graph and list any three applications of gr 3 z (©) Write postfix form of the following infix eace jon.) 3 AHBYCDYE) ‘. ¢ () Explain linear and nonlinear data s n 2 @) Write a note op recursion. 3 i 3 o # 2 @ SY. search tree for following 10 F | ~ ao Gorin ‘Write an elgorithm to implement 10 nae linked List. 3 Waite aw algorthin for impterenting stack using array. 10 (site an algorithm for merge sort and comment on its complexity. 10 ‘given below: Inorder: DBEAFCG Preorder: ABDECFG ‘Write a function to traverse a tree in Postorder sequence. (b) Write anvalgorithm for quick sort and comment on its complexity, 10 a? (@) © Construct the binary tree for Inorder and Preorder traversal sequence 10 76927 Page 1 of 2 Toure A2S7SSD617D7D6S348366D 529852497(b) 6 76927 Paper / Subject Code: 51403 / Data Structures and Analysis ‘What is collision? What are the methods to resolve collision? Expla Linear probing with an example. ‘What is Minimum Spanning Tree? Draw the MST using kruskal"s and prim’s algorithm and find out the cost with al intermediate steps. Page 2 of 2 A25758D617D7D65348366DA529B52A97 20