Answer the following. 1) Define Data structure. 2) Which data structure is used for DFS algorithm? 3) Define sparse matrix. 4) What is garbage collection? 5) Define Heap. 6) What is the full form of KWIC? 7) Linked list is a non linear data structure. (True/False)?
[7 marks]1) Explain Trie structure 2) List out the various asymptotic notations and explain them.
[4 marks]Define Searching. Give the difference between Linear search and Binary Search. Also give the algorithm for Binary search.
[7 marks]Write the algorithm for converting the infix expression to prefix and also explain it with example.
[7 marks]Write a short note on simple queue.
[7 marks]Write the algorithm for insertion sort and trace it for the following data. 34,15,22,18,2,10,92,56,44,78,55.
[7 marks]Give the node structure for polynomial with two variables represented using linked list. Also give the algorithm to add two polynomials using linked lists.
[7 marks]Write and explain the radix sort. Trace it for the following data. 112,342,116,765,345,902,104,651,333,298,789,100.
[7 marks]Define a linked list. Write the algorithm for inserting elements at the (end, beginning and middle) of the singly linked list.
[7 marks]Write a note on threaded binary tree.
[7 marks]Explain Prim’s algorithm for finding the minimum spanning tree from a graph.
[7 marks]Define BST. Draw the BST for the following data. 23,45,12,22,78,16,10,24,32,18,78,98,56,77. Which traversal will give the data in sorted fashion? Trace it and prove it.
[7 marks]1) Explain the matrix representation of graphs 2) Convert the following infix expression to postfix : (a+b)/(c-d)*e/f*g/h-(m+p)
[4 marks]Explain the various collision resolution techniques.
[7 marks]1) Give the limitations of singly linked lists over double linked lists 2) Write a note KWIC indexing.
[4 marks]Write a short note on 2-way merge sort.
[7 marks]Explain the rotations of the AVL trees.
[7 marks]