Total No, of Questions 8] SEAT No. : P649 15869]-277 [Total No. of Pages :3 S.E. (Computer Engineering) DATA STRUCTURES AND ALGORITHMS (2019 Pattern) (Semester - II) Time : 2% Hours] [Max. Marks: 70 Instructions to the candidates: 1) Answer Q.1 or Q.2, 0.3 or 0.4, 0.5 or 0.6, 0.7 ur Q.8. 2) Neat diagrams must be drawn wherever necessary. 3) Figures to the right indicate full marks. 4 Assume suitable data, if necessary. QI) a) Draw any directed graph with minimum 6 nodes and represent graph using adjacency matrix, adjacency list and adjacency multilist. [6] b) Consider the graph represented by the following adjacency matrix : 16] i) eae 1] ojo} i] s]o]o 2/6/0}5]0/3/0 3 {15 ]0] 5/6] 4 4]5]0]5 |] 0}]0)]2 5 [0[3]6] 0/0] 6 6} 010} 4) 2}6] 0 Find minimum spanning tree of this graph using prim’s Algorithm. ¢) Write a short note on topological sorting 16) OR Q2) a) Write non-recursive pscudo for Depth First Search (DFS). {61 b) Consider the given graph and find the shortest path by using Dijkstra's algorithm, From source to all other nodes. 16] PTO.°) Q3) a) b) c) O4) a) b) c) Show BFS and DFS for the following graph with starting vertex as 1. Explain with proper steps. [6] Explain with example (6) i) Red - Black Tree ii) Splay Tree Construct AVL tree for following sequence of keys {6] 1,2,3,4, 8, 7,6, 5. 11, 10 What is OBST in data structure? and what are advantages of OBST?[5] oR Explain the following: i) Static and dynamic tree tables with suitable example. 13] ii) Dynamic programming with principle of optimality. 13] Write short note on: {61 i) AAtree ii) K-dimensional tree Explain AVL tree rotations with example. 5] [5869]-277 2Q5) a) b) c) Q6) a) b) c) Q7) a) b) 8) a) b) c) Construct B tree of order § for the following data: 6] 78, 21. 14. 11, 97, 85, 74, 63, 45, 42, 57 Explain B+ wee delection with example. lo] What is B+ tree? Give structure of it’s internal note. What is the difference between B and B+ tree, lo] OR Build B+ tree of order 3 for the following data: FS,QK, CLT V.W,M,R 16] Write an algorithm of B tree deletion. lo) Explain with example trie.tree, Give advantage and applications of trie tree. 6] Define sequential file organization. Give it’s advantages and disadvantages. [6] What is file? List different file opening modes in C++. Explain concept of inverted fil (6) Write short note on external sort. (51 OR A write a C+ program to create a file, Insert records into the file by opening file in append mode. Search fora specific record into file. [6] Sort the following elements using two way merge sort with m= 3. 20, 47, 15, 8, 9. 4, 40. 30, 12. 17, 11. 56. 28. 35 16] Explain indexed sequential file organization. Compare it with direct access file. [5] 303 BORD 15869]-277 3