Write the classification of data structure.Explain each one in short.
[7 marks]Describe operations that can be performed on a data structure.
[7 marks]Explain method to convert infix expression into postfix using stack.
[7 marks]Describe applications of stack in recursion with example.
[7 marks]Explain Circular Linked List with its basic operations.
[7 marks]List out tree traversal techniques. Discuss each one.
[7 marks]Explain Binary Search Tree with the help of example.
[4 marks]Define following for tree. 1) Degree of a tree 2) terminal node 3) Complete Binary Tree 4) Sibling
[3 marks]Explain conversion of general tree & forest into binary tree with example.
[7 marks]Write short note on sequential and linked representation of tree.
[7 marks]Explain BFS with example.
[7 marks]Describe the matrix representation of graphs in detail.
[7 marks]Explain DFS with example.
[7 marks]Explain height balanced tree with example.
[7 marks]List out any five hashing functions. Briefly explain any three.
[7 marks]Describe heap sort with suitable example.
[7 marks]Write short note on sequential search with example.
[7 marks]Describe insertion sort with suitable example.
[7 marks]