Answer the following. 1. Define: Data Structures. 2. What is an Algorithm? 3. What is isolated node? 4. What is Null graph? 5. What is Cycle in graph? 6. List out the applications of Queue. 7. What is meaning of height of the tree?
[7 marks]What is Asymptotic analysis? Explain all the notations of Asymptotic analysis.
[7 marks]Convert the given infix notation into postfix notation using stack. A * ( B + C ) / D + E * F
[7 marks]Write the algorithm for inserting the node in sorted order in singly linked list.
[7 marks]List out the application of the linked list? Explain how to add two different polynomials using linked data structure.
[7 marks]Explain the algorithm for deleting the node from binary search tree using suitable example.
[7 marks]Explain different techniques for representation of the trees with example.
[7 marks]Explain Preorder, Inorder and Postorder traversal of binary tree using example.
[7 marks]Discuss Manipulation of Arithmetic Expression using Tree in detail.
[7 marks]Explain Matrix and Linked Representation of Graphs with example.
[7 marks]Apply the Prim’s and Kruskal algorithm on following graph and find the minimum cost to connect all nodes. Page 1 of
[2 marks]Discuss the Dijkstra’s Algorithm in detail.
[7 marks]Define the terms: 1. Graph 2. Tree 3. Mixed Graph 4. Outdegree 5. Elementary Path 6. Adjacent Nodes 7. Loop.
[7 marks]Discuss the binary search algorithm with example.
[7 marks]Sort the following data using selection sort. Write all the intermediate passes. 41, 24, 74, 11, 66, 58, 94, 36, 99, 87
[7 marks]Apply the quick sort on the following data and sort the following data? Also write the algorithm for the quick sort. 42, 56, 32, 11, 24, 88, 58, 74
[7 marks]What is hashing? Discuss collision resolution technique in hashing. Page 2 of
[2 marks]