Prefix,Postfix,Infix Notation

1. Transform the following infix expression to postfix form:
(A+B)*(C-D)/E

2. Transform the following infix expression to postfix form:
A-B /(C*D)

3. Evaluate the following prefix expression * – + 4 3 5 / + 2 4 3

4. Which of the following is an infix expression?

5. Parentheses are simply ignored in the conversion of infix to postfix expression.

6. It is easier for a computer to process a postfix expression than an infix expression.

7. What is the postfix expression for the infix expression?

a-b-c

8. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

9. Evaluate the following postfix expression 1 4 18 6/3 + + 5 / +

10. Transform the following infix expression to prefix form:

((c*2)+1)/(a+b)

11. Transform the following infix expression to prefix form:

Z – ((((X + 1)*2)-5)/Y)

12. Here is an infix expression: 4 + 3 * (6 * 3 – 12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. What is the maximum number of symbols that will appear on the stack at one time during the conversion of this expression ?

13. What is the value of the postfix expresion 6 3 2 4 + – *

14. If the expression ((2 + 3) * 4 + 5 * (6 + 7) * 8) + 9 is evaluated with * having precedence over +, then the value obtained is same as the value of which of the following prefix expression ?

15. Evaluate the following prefix expression: +*2+/ 14 2 5 1 ________

16. Parenthesis are never needed prefix or postfix expression:

17. A postfix expression is merely the reverse of the prefix expression:

18. Which among the following data structure may give overflow error, even through the current number of elements in it, is less than its size:

19. Convertion of infix arthimetic expression to postfix expression uses:

20. Match the following