Execute algorithm to convert infix into post fix expression, Data Structure & Algorithms

Assignment Help:

Q. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input

Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I

Ans:

The given infix expression is as follows:-

Q = [(A + B) / (C + D) ^ (E + F)] + (G + H) / I

Symb Stack Postfix Notation

[ [

( [ (

A [ ( A

+	[ ( +
B	[ ( +	AB
)	[	AB+
/	[ /
(	[ / (
C	[ / (	AB+C
+	[ / ( +
D	[ / ( +	AB+CD
)	[ /	AB+CD+
^	[ / ^
(	[ / ^ (
E	[ / ^ (	AB+CD+
/	[ / ^ ( /	AB+CD+
F	[ / ^	AB+CD+/
]	EMPTY	AB+CD+EF/^/
+	+
(	+ (
G	+ (	AB+CD+EF/^/G
+	+ ( +
H	+ ( +	AB+CD+EF/^/GH
)	+	AB+CD+EF/^/GH+
/	+ /	AB+CD+EF/^/GH+
I	+ /	AB+CD+EF/^/GH+I

POSTFIX is:- AB+CD+EF/^/GH+I/+

Related Discussions:- Execute algorithm to convert infix into post fix expression

Abstract type, define abstract type

define abstract type

How do you find the complexity of an algorithm, How do you find the complex...

How do you find the complexity of an algorithm? Complexity of an algorithm is the measure of analysis of algorithm. Analyzing an algorithm means predicting the resources that

Mapping constain, one to many one to one many to many many to one

one to many one to one many to many many to one

Algorithm, implement multiple stacks in a single dimensional array. write a...

implement multiple stacks in a single dimensional array. write algorithm for various stack operation for them

Binary codes, what is alphanumerical code

what is alphanumerical code

Determine the disjoint of division method, Determine the Disjoint of divisi...

Determine the Disjoint of division method A polygon is disjoint from the viewport if the x- and y-extents of the polygon do not overlap the viewport anywhere. In this case; reg

Infix to postfix, [(a+b)/(c+d)^(e+f)]+(g+h)/i

[(a+b)/(c+d)^(e+f)]+(g+h)/i

Prefix and Postfix Expressions, Q. Draw the expression tree of the infix ...

Q. Draw the expression tree of the infix expression written below and then convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

What is algorithm, What is Algorithm A finite sequence of steps for a...

What is Algorithm A finite sequence of steps for accomplishing some computational task. An algorithm should Have steps which are simple and definite enough to be done

Discuss the brute force algorithm, Question 1 What do you mean by Amortiza...

Question 1 What do you mean by Amortization? Question 2 Explain the following Big Oh notation (O) Omega notation (Ω) Theta notation (Θ) Question 3 Di

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages