‘SVKM’s NMIMS MUKESH PATEL SCHOOL OF TECHNOLOGY MANAGEMENT & ENGINEERING Programme: MBA Tech (Computer) Year: I Semester: III Batch: 2017-18 Academic Year: 2017-2018 Subject: Data Structure & Algorithms Marks: 70 Date: 31 May 2018 “ Time: 10.00 am to 1.00 pm Durations: 3 (Hrs) No. of Pages: Re-Examination Instructions: Candidates should read carefully the of the Answer Book, which is provided for their use. 1) Question No. lis compulsory. 2) Out of remaining questions, attempt any 4 questions. 3) In all 5 questions to be attempted. 4) All questions carry equal marks. 5) Answer to each new question to be started on a fresh page. 6) Figures in brackets on the right hand side indicate full marks. 7) Assume suitable data if necessary. QI A) Explain an expression tree with an example. B) Compare Greedy method and Dynamic programming approach. C)_ What is abstract data type (ADT)? Explain Stack as an ADT. 1D) Which sorting technique according to you is best? Why” Q.2.A) What isa graph? Explain methods to represent a graph in computer memory. B) Suppose you are given ‘n’ number of coins, in that one coin is faulty, its weight is less than standard coin weight. Find the faulty coin in a fist using proper searching method. What will be the complexity of the searching method? Q3 A) Define binary tree traversal. Explain different types of traversals of binary tree with example. B) Explain BSF graph traversing technique in details with an example. @ 6) @ 6) a ” a” aMQ4 A) What is the need of priority queue? What data structure can be used to implement it? Write an algorithm to insert an item into the priority queue. B) What is doubly linked list? Write an algorithm to insert an item at the end of the linked list and delete an item from the beginning. . Q5 A) Write an algorithm for Merge sort and derive its best and worst case time complexity. B) Construct an AVL tree for the following data: 15, 20, 24, 10, 13, 7, 30, 36, 25. Q6 A) Find the minimum cost spanning tree for the following figure using Prim’s algorithm. 2 ~ 10 50 iG 40 45 35 Gs a 25 15 58 20 30 B) Write an algorithm to convert Infix to Postfix, Convert the following expression into its equivalent postfix form. A *B*C+D. Q.7 A) Write a function to insert an element at the beginning and delete an element from the end of the singly linked list, B) Write an algorithm for selection sort and discuss its time complexity. am @) @ a a o ga a