ASSIGNMENT 01

• Attempt any 6 questions, but Questions 5, 7, 8, and 9 are mandatory.
• Use A4 paper only.
• Use this as a Frontpage.

  Click here to download Frontpage .

Questions:

1. Explain doubly linked list operations in detail.
2. Devise an algorithm for following operations of Single Linked List.
   • a. Insert a new node before a node
   • b. Delete Last node
3. Explain how to create circular linked list and insert nodes at end ?
4. Explain the operations simple Queue
5. Covent the following Infix Expression to Postfix Expression
   • ((3*4)/5+3*2-6*2)
   • A + (B * C) - ((D * E + F) / G)
6. Explain the procedure to evaluate postfix expression and evaluate the following expression 6 2 3 + - 3 8 2 / + * 2 % 3 +
7. Explain binary search tree. Creat a BST for the following values

• 56,30,40,50,69,77,80,90,20,10
• Q,E,C,I,J,T,W,Z,X

8. Explain AVL tree with an example. Explain all types of rotation in AVL tree with an Example ?
9. Explain B tree with an example. Construct a B-Tree of order 5 by inserting the keys: 11, 25, 55, 15, 60, 30, 80, 19, 27.