BTS (C)-IV(S)- 11 - 005-E B.Tech. Degree IV Semester (Supplementary) Examination ‘Time : 3 Hours . ul. Vv. vi. Vi. Vil. Ix. @) (b) (©) @ © oO @) ) @ &) @ © January 2011 CS/AT 405 DATA STRUCTURES AND ALGORITHMS (2006 Scheme) Maximum Marks : 100 PART-A (Answer ALL questions) (8x5= 40) Differentiate between selection and babble sorting techniques with algorithms. Write short notes on sparse matrices. Explain how insertion and deletion are done in a circular queue with algorithms. Explain the evaluation of post fix expression with algorithm. Explain the different methods for representation of tree. Write short notes on AVL tree. Explain Kruskal algorithm for the construction of minimum spanning tree. What are the different methods to represent a graph in memory? PART-B (4x15 = 60) With suitable algorithm and example show how merge sort takes place. (as) OR Discuss the various searching algorithms with example. (Linear, Binary, Fibonacci) as) Explain the procedure for the conversion of infix expression to postfix expression. (as) OR Explain the implementation of queue using array and lists. (as) Explain the in order, pre order and'post order traversals on tree. (1s) OR Write short notes on : @ Tree Gi) Expression Tree (ii) Threaded Binary Tree (1s) Discuss the DFS and BFS graph traversal techniques. 3) Explain Prim’s algorithm for the construction of minimum spanning tree. M OR Explain Dij Kstras algorithm. @) Write short notes on B- tree and B+ tree. a ood