Practice Questions for UT-II


       4  Marks Questions :
       1. What is Recursion? Explain Recursive Flow Chart
       2 What is Binary Tree? Write down its types with example.
       3. Write a note on advantages and disadvantages of recursion.
 4. Evaluate the following postfix expression 456 + 7 –..     
 5. Define Queue. Write and explain different operations performed on queue.
 6.  Write an algorithm for “Postfix Expression Evaluation”. Give an example.
 7. Explain basic operations on stack with neat diagrams.
 8. Convert infix to postfix using the algorithm:  (A+B) * (C+D) - E.
 9. What is value of postfix expression   579*+493/+-   ?
 10. Differentiate between Static and Dynamic memory allocation.
 11. What is circular queue? Explain with neat diagrams how elements are inserted and
     deleted from circular queue.
 12. What is the basis part of recursive function? Explain why it is essential for recursion.
      Give an example.
13.What is Stack? Explain its operations
14. What is Queue? Explain its operations
    
       8  Marks Questions :
1. Explain Tree Traversal Methods with Example.
2. Write down following programs using recursion.
a. Factorial of a number.
b. Multiplication of two numbers.
3. What is Tree? Define following terms root, leaf node, interior nodes, siblings, subtree, level, height, degree with an example.
4. Write an algorithm to convert infix expression to postfix expression. Give Example.
5. Explain -     1. Linear Queue       2. Priority Queue       3. DEQUE
6. Write C program to implement following stack operations
             i) Push     ii) Pop      iii) Stack Empty      iv) Stack Full       v) Stack Display
7.  Explain singly linked list insertion cases.
8.  What I Singly Linked List? Explain its operations
9.  What is Circular Linked List? Explain with an Example.