Unit-3 Stack & Queue

1. Convert following expression into POSTFIX and PREFIX expression.

a) A $ B * C - D + E / F / ( G + H )

b) A – B / (C * D $ E )

2. write the type of Data Structure.

3.Explain the stack push and pop operation.

4. Evaluating a postfix operation using algorithm

a) 562/3+13*- 2*

b) 234+-67/9*-3+

5. Infix to Postfix conversion using Stack

A* (B+C-(DE/I^F)*G)*H

6. Evaluate following postfix expressions while showing status of stack

after each operation given A=3, B=5, C=1, D=4
a)AB+C*
b) A B * C / D *

7. Convert the following infix notations to postfix notations, show each

step.
a)A+B-C*D
b) A * (( C + D)/E)

8. POP Operation of Queue with Algorithm.

9. Difference between Single and Circular Queue.