Beruflich Dokumente
Kultur Dokumente
Unit-II
1.Convert the infix expression a+b^c+(d*e/f)*g to postfix expression and evaluate the same
using stack. a=3, b=5, c=2, d=7, e=4, f=1, g=8
2.Explain the operations and the implementation of Stack ADT using Array.
3. Explain the operations and the implementation of Queue ADT using Linked list
4. Explain Prefix, Infix and postfix expressions with an example.
5 .Briefly describe the operations of stack and queue with examples.
Unit-III
1. Write an algorithm to find an element from binary search tree.
13, 3, 4, 15, 19, 25, 35, 69, 15, 12, 14, 17, 18.
2. Write an algorithm to insert , delete, Find minimum and maximum element from binary search tree
3.What are the tree traversal techniques? Explain with an example.
4.Explain the AVL tree insertion and deletion with suitable example
5. Explain about B-Tree and B+ Tree with suitable example
Unit-IV
1. Explain Breadth First and Depth first Search algorithm in detail
2. Describe in detail about the following representations of a graph(a) Adjacency Matrix (b) Adjacency List
3. Illustrate Kruskal’s algorithm to find the minimum spanning tree of a graph. Trace the algorithm for the
following graph
Questions Are Expected for University Exams This May or may Not Be Asked for Exams
Please do not Copy (or) Republish This Questions, Students if You Find the Same Questions in Other Sources,
Kindly report us to rejinpaulteam@gmail.com