Syllabuses

Write functions to implement recursive versions of preorder, inorder and postorder traversals of binary trees. Use stack to implement the recursion.

How can you convert an infix expression to postfix expression using stack? Give one example.

Write an algorithm which reverses the order of elements of stack using one additional stack and some additional variables?

Write an algorithm for insertion and deletion in Priority Queues.

Define: i) Data and information ii) Abstract Data Types iii) Polynomials b) Write an algorithm for traversing nodes in a single linked list? Explain with an example.

Discuss various classifications of data structures with an example.

What is Hashing? Explain different Hash function method in detail.

Explain Bubble Sort with the help of example.

Explain Breadth First Search traversal of Graph using an example.

Discuss following with reference to trees: i) Height of tree ii) Expression tree iii) Complete Binary tree iv) Sibling v) Full Binary tree vi) Path length vii) External Node viii) Internal Node ix) Degree of vertex x) Acyclic Graph