Q1: Transform
the following infix expression to their equivalent
postfix expressions using stack.
(Note: show each step while
transforming) (A-B)/C*((C-D/C+D)) (5)
Q2:
Write an algorithm to insert an item
in to the Queue, where Queue is
implemented using array. (5)
Q3: Explain
in detail about LL rotation by taking a suitable example. (10)
Q4: Write a
non-recursive algorithm of preorder
traversal of Binary Tree. Write
preorder traversal for given tree atlast. (10)
SET-2
Q1: Show
each step to Evaluate the postfix
expression: 7, 5, 2, +, *, 4, 1, 5, -,
-, 1, -,/ (5)
Q2:
Write an algorithm to insert an item
in to the Queue, where Queue is
implemented using Linked List. (5)
Q3:
Explain in detail about RR rotation by taking a suitable example. (10)
Q4: Write a
non-recursive algorithm of inorder traversal
of Binary Tree. Write inorder traversal for given tree atlast. (10)
SET-3
Q1: Show each step to sort the given list using quick sort, list is: 41, 65, 35, 21, 48, 59, 87, 28. (5)
Q2:
Write an algorithm to delete an item
in to the Queue, where Queue is
implemented using array. (5)
Q3:
Explain in detail about R0 rotation by taking a suitable example. (10)
Q4: Write a
non-recursive algorithm of postorder
traversal of Binary Tree. Write postorder traversal for given tree atlast. (10)