What is time complexity? Explain with example.
[3 marks]Explain malloc and free functions in ‘C’. Also discuss advantages of dynamic over static memory allocation.
[4 marks]Explain following:
[7 marks]priority queue (ii) primitive data structures (iii) non-primitive data structures (iv) linear data structures (v) nonlinear data structures (vi) applications of stack (vii) sparse matrix
[ marks]Write an algorithm for infix to postfix conversion.
[3 marks]Write an algorithm to evaluate postfix expression. Explain working of the algorithm using appropriate example.
[4 marks]Write a ‘C’ program to reverse a string using stack.
[7 marks]Write algorithm to (i) insert, and (ii) delete elements in circular queue.
[7 marks]Write user defined ‘C’ function to insert node at a specific location in singly linked list.
[3 marks]Write user defined ‘C’ function to delete node from end in circular linked list.
[4 marks]Write a ‘C’ program to implement queue using linked list.
[7 marks]Write user defined ‘C’ function to insert node at the end in circular linked list.
[3 marks]Write user defined ‘C’ function to delete node from a specific location in doubly linked list.
[4 marks]Write a ‘C’ program to implement stack using linked list.
[7 marks]Construct a binary tree from the traversals given below: Inorder: D, B, A, E, G, C, H, F, I Preorder: A, B, D, C, E, G, F, H, I
[3 marks]Write a short on AVL tree.
[4 marks]Explain the concept of B-tree with suitable example and list its applications.
[7 marks]Construct a binary search tree from the following numbers. 38, 13, 51, 10, 12, 40, 84, 25, 89, 37, 66, 95
[3 marks]Explain BFS and DFS.
[4 marks]Explain B+ tree with example.
[7 marks]Explain Prim’s algorithm.
[3 marks]Write a ‘C’ program for selection sort.
[4 marks]List out different hash methods and explain any three.1
[7 marks]Define terms with respect to file: fields, records, database
[3 marks]Compare sequential and binary search methods.
[4 marks]Apply quick sort for the following data: 9, 7, 5, 11, 12, 2, 14, 3, 10,
[6 marks]