Explain Time and Space analysis of algorithms.
[7 marks]Explain Linear and Non-Linear Data Structures.
[7 marks]Give the applications of Stack, Queue and Linked Lists
[7 marks]Explain recursion with the example of Tower of Hanoi problem.
[7 marks]Convert the expression a + b * c / d ^ e + 7 * 8 to reverse polish notation.
[7 marks](1) Consider the status of following doubly ended queue. What will be the state of this queue and F, Rafter all the operation in sequence? 5 8 2 - - F R 1. Insert 7 and delete one element. 2. Insert 3. 3. Insert 4. 4. Insert 9 and delete one element. (2) Explain the Insert operations on Doubly Linked Lists.
[4 marks]Explain the linked implementation of Stack with example.
[7 marks](1) Give an example of Crepresentation of Linked Lists. (2) List the differences between Graphs and Trees.
[4 marks]What are AVL trees? Construct an AVL tree by inserting following integers step by step. 88, 77, 22, 11, 55, 66, 33, 44
[7 marks](1) Define Terminal Node, Forest and Sibling Node. (2) Explain the Linked list representation of binary tree.
[4 marks]Explain threaded binary tree with example and justify its performance advantage over normal binary trees.
[7 marks](1) Define Complete Graph, Connected Graph and Multi-Graph. (2) Explain the adjacency list representation of a graph.1
[4 marks]Perform the B-tree insertion on following values. Consider the insertion on a B-Tree of degree 4. The values are as follows: 9, 8, 1, 5, 11, 13, 7, 3, 9, 8, 20, 19
[7 marks]Explain in brief the Hashing functions.
[7 marks]Make the following tree a threaded binary tree. 1 -999 NUL 0 L120
[7 marks]Explain Collision resolution techniques.
[7 marks]What is MST? Perform Prims algorithm to find MST on following graph. 1 b a c369 d e g7 f h i2
[5 marks]