Describe characteristics of an algorithm.
[7 marks]Explain the classification of data structure.
[7 marks]Explain method to calculate the address of any element in one dimensional and two dimensional arrays.
[7 marks]Explain Doubly Linked List with its basic operations.
[7 marks]Write the algorithm to convert infix expression to reverse polish expression.
[7 marks]Enlist and explain tree traversal techniques.
(i) Define following for tree. 1) Sibling 2) Leaf node 3) degree 4) height (ii) Explain BST in short.
[3 marks]Write short note on sparse matrix.
[7 marks]Explain complete binary tree with example.
[7 marks]Explain DFS with example.
[7 marks]Describe the matrix representation of graphs in detail.
[7 marks]Explain BFS with example.
[7 marks]Explain 2-3 tree with example.
[7 marks]Write short note on binary search with example.
[7 marks]Describe bubble sort with suitable example.
[7 marks]Enlist different hashing functions. Briefly explain any three.
[7 marks]Describe selection sort with suitable example.
[7 marks]