Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Infix to-postfix examples by mua99 39036 views
- Conversion from infix to prefix usi... by Haqnawaz Ch 33377 views
- computer notes - Evaluating postfix... by ecomputernotes 8957 views
- Infix to postfix conversion by Then Murugeshwari 32098 views
- Infix prefix postfix expression -c... by Syed Mustafa 5896 views
- Infix to Prefix (Conversion, Evalua... by Ahmed Khateeb 37552 views

3,792 views

Published on

this is just to explain how expression is converted from postfix to infix in data structure

No Downloads

Total views

3,792

On SlideShare

0

From Embeds

0

Number of Embeds

6

Shares

0

Downloads

119

Comments

0

Likes

1

No embeds

No notes for slide

- 1. DATA STRUCTURES USING ‘C’
- 2. Evaluation Of Postfix
- 3. Evaluation Of Postfix -BY AKHIL AHUJA
- 4. What is Postfix expression? IF THE OPERATOR SYMBOLS ARE PLACED AFTER ITS OPERANDS , THEN THE EXPRESSION IS IN POSTFIX NOTATION. Postfix expression is also known as Reverse Polish Notation(RPN). In RPN the operators follow their operands. Despite the name , Reverse Polish Notation is not exactly the reverse of polish notation , for the operands they are still written in conventional manner. For eg : “*63”in polish notation and “63*” in reverse polish notation. In this , expression is different but the answer is same (i.e 18)
- 5. Precedence of operators: 1. ‘$’ or ‘^’ Highest Precedence 2. ‘*’ and ‘/’ High Precedence 3. ’+’ and ‘-’ Low Precedence 4. ‘=‘ Lower Precedence 5. ‘(‘ and ‘)’ Lowest Precedence
- 6. Fundamental principles followed while evaluating the postfix expression : 1.Read the expression from left to right. 2.If there comes an operand , push it into the stack. 3.If there comes an operator , pop operand 1 and operand 2 and then : A . Push ‘(‘ B . Push ‘operand 2’ C . Push ‘operator’ D . Push ‘operand 1’ E . Push ‘)’
- 7. Advantages of Postfix Expression: (A). Postfix notation is easier to work with. In a postfix expression operators operands appear before the operators, there is no need of operator precedence and other rules. In postfix expression the topmost operands are popped off and operator is applied and the result is again pushed to the stack and thus finally the stack contains a single value at the end of the process. (B). In postfix expression, there are no parentheses and therefore the order of evaluation will be determined by the positions of the operators and related operands in the expression.
- 8. Algorithm for Postfix Expression : 1.Read the element. 2.If element is an operand then: Push the element into the stack. 3.If element is an operator then : Pop two operands from the stack. Evaluate expression formed by two operand and the operator. Push the result of expression in the stack end. 4.If no more elements then: Pop the result Else Goto step 1.
- 9. How to evaluate postfix (manually) Going from left to right, if you see an operator, apply it to the previous two operands (numbers) Example: A B C * D / + E (B*C) ((B*C)/D) (A+(B*C)/D) ((A+(B*C)/D)-(E-F)) Equivalent infix: A+ B * C / D– (E– F) F - (E – F) -
- 10. Here’s an another example
- 11. 4 3 * 6 7 + 5 - + )
- 12. 4 3 * 6 7 + 5 - + ) Push the opening bracket ‘(‘ into the stack . STACK
- 13. 4 ( STACK 3 * 6 7 + 5 - + Operand ‘4’ push it into the stack )
- 14. 4 3 4 ( STACK * 6 7 + 5 - + ) Operand ‘3’ push it into the stack.
- 15. 4 3 * 3 4 ( STACK 6 7 + 5 - Now comes Operator ‘*’ + )
- 16. 4 3 * 6 7 + 5 - * 3 4 ( STACK Pop operand ‘3’ and ‘4’ + )
- 17. 4 3 * 6 7 + 5 - 4* 3 ( STACK Evaluate the expression 4*3 =12 Pus it into the stack + )
- 18. 4 3 * 6 7 + 5 - 4* 3 ( STACK Evaluate the expression 4*3 =12 + )
- 19. 4 3 * 6 7 + 5 - 4 * 3 12 Push it into the stack ( STACK + )
- 20. 4 3 * 6 7 + 5 - + Operand ‘6’ push it into the stack 12 ( STACK )
- 21. 4 3 * 6 Operand ‘7’ push it into the stack 7 + 7 6 12 ( STACK 5 - + )
- 22. 4 3 * 6 7 + 5 - Operand ‘7’ and ‘6’ Are popped Operand ‘+’ push it into the stack 7 6 12 ( STACK + )
- 23. 4 3 * 6 7 + 5 6+7 Evaluate ‘6+7’ =13 12 ( STACK + )
- 24. 4 3 * 6 7 + 5 13 Push it into the stack 12 ( STACK + )
- 25. 4 3 * 6 7 Operand ‘5’ push it into the stack 5 + 5 - 13 12 ( STACK + )
- 26. 4 3 * 6 Operands ‘5’ and ‘13’ are popped 7 + 5 - + ) 5 13 Now operator ‘-’ occurs 12 ( STACK
- 27. 4 3 * 6 7 + 5 - Evaluating “13-5” We get ‘8’ 12 ( STACK + )
- 28. 4 3 * 6 7 + 5 8 Now, push the resultant value i.e ‘8’ in the stack 12 ( STACK + )
- 29. 4 3 * Operator ‘+’ 6 7 + 5 - + ) 8 12 ( STACK
- 30. 4 3 * 6 7 + 5 - + 12 + 8 By Evaluating , we get 20 ( STACK )
- 31. 4 3 * 6 7 + 5 - + 20 So push ‘20’ in stack ( STACK )
- 32. 4 3 * 6 Now atlast ‘)’ occurs Now , pop the element till the opening bracket 7 + 5 - + ) 20 ( STACK
- 33. 4 3 * 6 7 + 5 - 20 + ) ) ( STACK
- 34. 4 3 * 6 7 + 5 - + ) 20 Now push the element AND THE FINAL ANSWRER IS ’20’ () STACK

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment