Define the following terms 1. Data Structure 2. Priority Queue 3. Adjacent Node 4. Binary Tree 5. Complete Graph 6. Linked List 7. Null Graph
[7 marks]What is the difference between stack and queue?
[7 marks]What is KWIC indexing? Write the algorithm to generate the KWIC index listing with example
[7 marks]Different between Linear Data Structures vs Non Linear Data Structures
[7 marks]Explain the data structure classification.
[7 marks]Give the processing order of preorder, inorder and postorder of given tree Also write the algorithm for preorder traversal.
[7 marks]What is recursion? Explain how stack is used in recursion.
[7 marks]What is Tree Node? List the Binary Search Tree Basic Operations and discuss it.
[7 marks]What is Sparse Matrices? Explain sequential representation of Sparse Matrices with example.
[7 marks]Compare BFS and DFS. Explain how it works with an example
[7 marks]What is Merge sort? Write its algorithm and state its complexity.
[7 marks]Explain the selection sort process on following data 14,33,27,10,35,19,42,44
[7 marks]Write algorithms for insertion and deletion of node in doubly linked list Page 1 of
[2 marks]What is hashing? List and explain Hashing function in detail.
[7 marks]Write shot notes on
[7 marks]Hash-Table Methods (ii) 2-3 tree
[ marks]Arrange following elements in sorted order using heap sort. 4,10,3,5,1
[7 marks]Explain Weight-Balanced Trees in detail. Page 2 of
[2 marks]