Postfix Expression Test

1. Reverse Polish Notation is the reverse of a Polish Notation.

2. In Postfix expressions, the operators come after the operands.

3. Which of the following is not an application of stack?

4. Evaluate and write the result for the following postfix expression
abc*+de*f+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.

5. What is the result of the following postfix expression?
ab*cd*+ where a=2,b=2,c=3,d=4.

6. What is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.

7. What is the time complexity of evaluation of postfix expression algorithm?

8. Evaluate the postfix expression ab + cd/- where a=5, b=4, c=9, d=3.

9. Which of the following is an example for a postfix expression?

10. Consider the stack
| 5 |
| 4 |
| 3 |
| 2 |.
At this point, '*' is encountered. What has to be done?