Answer the following questions. a. LIFO stands for________ b. Define data structure. c. Write two simple hash functions. d. List operations performed on a stack. e. Define Mixed Graph f. Write down complexity of binary search algorithm. g. Define Binary tree
[7 marks]Explain stack. Write an algorithm to PUSH & POP using array representation.
[7 marks]Explain the data structure classification.
[7 marks]What is KWIC indexing? Write the algorithm to generate the KWIC index listing with example.
[7 marks]Write an algorithm to perform various operations (insert, delete and display) for simple queue
[7 marks]Convert following expression in infix to postfix. a. (A+B^D) / (E-F) + G b. (A-B) * (C/D) + E
[3 marks]What is Sparse Matrices? Explain sequential representation of Sparse Matrices with example.
[7 marks]Write an algorithm for deletion of node at the end of singly linked list.
[7 marks]What is spanning trees? Explain DFS and BFS spanning trees in detail.
[7 marks]Discuss how following numbers are sorted using Quick Sort. 38,81,22,48,13,69,93,14,45,58,79,72
[7 marks]What is doubly linked list? Write procedure to insert and delete an element from doubly linked list.
[7 marks]Describe the matrix representation of graphs in detail.
[7 marks]Write short note on binary search with example.
[7 marks]What is hashing? Explain various techniques for collision resolution with appropriate example.
[7 marks]Explain Selection sort with algorithm.
[7 marks]Give the processing order of preorder, inorder and postorder of given tree.
[7 marks]List out Hashing Method. Explain any two of them.
[7 marks]