Define the following terms. 1. Priority Queues 2. Mixed Graph 3. Binary tree 4. Height of tree 5. Adjacent Node 6. Loop in Graph 7. Null Graph
[7 marks]What is KWIC indexing? Write the algorithm to generate the KWIC index listing with example.
[7 marks]Explain the storage structure for arrays in detail.
[7 marks]Write an insertion and deletion algorithms for Circular Queue.
[7 marks]What is recursion? Explain how stack is used in recursion.
[7 marks]Give the processing order of preorder, inorder and postorder of given tree. A B C D E F Also write the algorithm for preorder traversal. Page 1 of
[2 marks]What is Sparse Matrices? Explain sequential representation of Sparse Matrices with example.
[7 marks]Discuss the Matrix representation of Graphs? Also give the adjacency matrix for given graph. V1 V2 V5 V3 V4
[7 marks]Explain BFS and DFS in detail. Also give the difference between BFS and DFS.
[7 marks]Write an algorithm for insertion of node at the end of linked list.
[7 marks]Explain the application of trees in expression evaluation in details.
[7 marks]Explain the algorithm for deleting the node from binary search tree using example.
[7 marks]Explain the selection sort process on following data. 44,22,75,10,65,56,92,36,98,85
[7 marks]Discuss the Quick Sort algorithm with example.
[7 marks]What is Hash-Table Methods? Discuss the Division Method in detail.
[7 marks]Explain Weight-Balanced Trees in detail.
[7 marks]Write algorithms for insertion and deletion of node in doubly linked list. Page 2 of
[2 marks]