Answer the Following. 1. Define : Data Structures 2. Define :Primitive data structure 3. Give two example of Stack application. 4. Define graph. 5. What is dequeue? 6. Write application of tree. 7. Trie structure.
[7 marks]Answer the Following. 1. Define Minimum spanning tree. 2. Full form of KWIC. 3. Write application of queue. 4. Define Acyclic Graph. 5. Draw the node structure to represent polynomial having two variables. 6. Define Directed Graph. 7. Differentiate complete binary tree and full binary tree.
[7 marks]Explain Tower of Hanoi problem of moving 3 discs.
[7 marks]Write an algorithm to add two one variable polynomials.
[7 marks]Write the algorithm to convert infix to postfix and convert the following expression into postfix. A + B * C / D – E + F * G
[7 marks]What are the operations performed on stack? Write algorithm to insert, update and delete element from stack.
[7 marks]Define Queue and Circular Queue. Also Explain How Circular Queue differs from Queue? Write an algorithm for insert of new element into Circular Queue.
[7 marks](1) Explain KWIC Indexing. (2) Explain Weight Balanced Tree. (3) Write the similarity & difference between tree and graph. Write the names of traversing methods of graph.
[3 marks]Explain pre-order, post-order and in-order traversal in binary tree.
[7 marks]Explain and show Quick Sort on the following set of Numbers.
[7 marks]Define Sparce Matrix. Explain the Representation of Sparce Matrix with example.
[7 marks]Define Searching. Write an algorithm for Binary Search.
[7 marks]Sort Following data using Heap Sort 18, 25,38,12,8,22,48,39,72,36
[7 marks]Explain Dijkstra’s algorithm with example.
[7 marks]1. Give difference Between BFS and DFS. 2. What is hashing? Write any one Collision Resolution Technique.
[3 marks]Explain Kruskal’s Algorithm with example.
[7 marks]Explain AVL tree with suitable example.
[7 marks]