Define the following terms. i. LIFO stands for________ ii. Null Graph iii. Write down complexity of binary search algorithm. iv. Write two simple hash functions. v. Mixed Graph vi. FIFO stands for_______ vii. List operations performed on a stack.
[7 marks]Explain the storage structure for arrays in detail.
[7 marks]What is KWIC indexing? Write the algorithm to generate the KWIC index listing with example.
[7 marks]Discuss difference between Linear data structure V/s Non-linear data structure.
[7 marks]Explain Doubly Linked List with basic operations.
[7 marks]Describe the concept of Queue in data structure with its insertion and deletion Operations.
[7 marks]What is Sparse Matrices? Explain sequential representation of Sparse Matrices with example.
[7 marks]What is Tree Node? List the BST Basic Operations and discuss it.
[7 marks]Explain BFS and DFS in detail. Also give the difference between BFS and DFS.
[7 marks]Write an algorithm for deletion of node at the end of singly linked list.
[7 marks]What is binary tree traversal? What are the various traversal methods? Explain any two with suitable example.
[7 marks]Explain the application of trees in expression evaluation in details.
[7 marks]Discuss Bubble sort in detail.
[7 marks]Explain Weight-Balanced trees in detail.
[7 marks]Explain Merge-sort algorithm with example.
[7 marks]Discuss Quick-sort algorithm with example.
[7 marks]What is Hash-Table Methods? Discuss the Division Method in detail.
[7 marks]