Algorithm to evaluate expression given in postfix notation , Data Structure & Algorithms

Assignment Help:

Q. Write down an algorithm to evaluate an expression given to you in postfix notation. Show the execution of your algorithm for the following given expression.

AB^CD-EF/GH+/+*

Ans.

Algorithm to evaluate Post fix Expression is shown as follows

Opndstk = the empty stack;

/*scan the input string reading one */

/*element at a time into symb */

while ( not end of input){

symb = next input character;

if (symb is an operand)

push (opndstk, symb);

else

{

/* symb is an operator */

opnd 2 = Pop (opnd stk);

opnd 1 = Pop (opnd stk);

value = result of applying symb to opnd 1 and opnd 2;

push (opndstk,value);

}/*end else */

}/*end while */

return (pop (opnd stk));

AB^CD-EF/GH+/+*

Symb	Opnd1	Opnd2	Value	Opndstk
A				A
B				A,B
^	A	B	A^B	A^B
C	A	B	A^B	A^B,C
D	A	B	A^B	A^B,C,D
-	C	D	C-D	A^B,C-D
E	C	D	C-D	A^B,C-D,E
F	C	D	C-D	A^B,C-D,E,F
/	E	F	E/F	A^B,C-D,E/F
G	E	F	E/F	A^B,C-D,E/F,G
H	E	F	E/F	A^B,C-D,E/F,G,H
+	G	H	G+H	A^B,C-D,E/F,G+H
/	E/F	G+H	(E/F)/(G+H)	A^B,C-D, (E/F) /(G+H)
+	C-D	(E/F)/(G+H)	(C-D)+(E/F)/(G+H)	A^B,(C-D)+ (E/F)/(G+H)
*	A^B	(C- D)+(E/F)/(G+H)	A^B*((C-D)+ (E/F)/(G+H))	A^B*((C-D)+ (E/F)/(G+H))

Related Discussions:- Algorithm to evaluate expression given in postfix notation

Graph and BFS, traverse the graph as BFS

traverse the graph as BFS

Binary search, Explain binary search with an example

Explain binary search with an example

Calculate address of an element in an array., Q. Explain the technique to c...

Q. Explain the technique to calculate the address of an element in an array. A 25 × 4 matrix array DATA is stored in memory in 'row-major order'. If base address is 200 and

Algorithm that inputs the codes for all items in stock, A shop sells books,...

A shop sells books, magazines and maps. Every item is identified by a unique 4 - digit code. All books have a code which starts with 1, all maps have a code starting with 2 and all

Convertion, how we can convert a graph into tree

how we can convert a graph into tree

Threaded Binary Tree, If a node in a binary tree is not containing left or ...

If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

Algorithm to build a binary tree , Q. Give the algorithm to build a binary ...

Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

Flowchart, conversion of centrigral to frahenhit

conversion of centrigral to frahenhit

String manipulation, what is string manipulation?

what is string manipulation?

#stone game\.c, stone game in c programming

stone game in c programming

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages