Explain primitive, non-primitive, linear and non-linear data structures.
[4 marks]Explain time and space complexity of an algorithm.
[3 marks]Define following terms:
[7 marks]data structures (ii) recursion (iii) sparse matrix (iv) degree of graph (v) minimum spanning tree (vi) complete binary tree (vii) double ended queue
[ marks]Write a Cprogram to implement stack using array with push, pop and display functions.
[7 marks]Evaluate following expression using stack. 6 2 3 + - 3 8 2 / + * 2 $ 3 +
[3 marks]Convert the following expression into postfix form. 1. A ^ B * C - D + E / F / ( G + H ) 2. ( A + B ^ C ^ D ) * ( E + F / D )
[4 marks]Explain with example: circular queue
[3 marks]Write user defined Cfunction to insert and delete a node at/from end in doubly linked list.
[7 marks]Write and discuss applications of stack and queue.
[4 marks]Differentiate between array and linked list.
[4 marks]Write user defined Cfunction to insert and delete a node at/from specific location in singly linked list.
[7 marks]Explain with example: priority queue
[3 marks]Construct a binary tree from the traversals given below: Inorder: 0, 10, 20, 30, 40, 50, 60, 70, 80, 90 Preorder: 50, 10, 0, 40, 30, 20, 90, 80, 60, 70
[3 marks]Write a short on height balanced and weight balance tree.
[4 marks]Explain insertion operation in the 2-3 tree: (i) if the parent has 2 children and (ii) if the parent has 3 children.
[7 marks]Construct a binary search tree from the traversals given below: Inorder: 20, 30, 35, 40, 70, 80, 90, 100 Postorder: 20, 35, 30, 80, 70, 100, 90, 40
[3 marks]Write a short on breadth first search and depth first search in graph.
[4 marks]Explain AVL tree with example.1
[7 marks]Explain binary search with example.
[3 marks]Write a Cprogram for bubble sort.
[4 marks]Explain the techniques for collision-resolution in Hashing with example.
[7 marks]Explain sequential search with example.
[3 marks]Write an algorithm for quick sort.
[4 marks]Explain sequential files and indexed sequential files structures.
[7 marks]