Infix expression into the postfix expression, Data Structure & Algorithms

Assignment Help:

Q. Convert the given infix expression into the postfix expression (also Show the steps)

A ∗ (B + D)/ E - F(G + H / k )

Ans.

Steps showing Infix to Post fix

Symbol	Postfix String	Opstk
A	A
*	A	*
(	A	*(
B	AB	*(
+	AB	*(+
D	ABD	*(+
)	ABD+	*(
/	ABD+*	/
E	ABD+*E	/
-	ABD+*E/	-
F	ABD+*E/F	-
*	ABD+*E/F	-
(	ABD+*E/F	-(
G	ABD+*E/FG	-(
+	ABD+*E/FG	-(+
H	ABD+*E/FGH	-(+
/	ABD+*E/FGH	-(+/
K	ABD+*E/FGHK	-(+/
)	ABD+*E/FGHK/+-

Related Discussions:- Infix expression into the postfix expression

Estimate the probability that the noncritical path , An advertising project...

An advertising project manager developed the network diagram shown below for a new advertising campagign. In addition, the manager gathered the time information for each activity,

Efficiency of linear search, Efficiency of Linear Search How much numbe...

Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

Minimum cost spanning trees, A spanning tree of any graph is only a subgrap...

A spanning tree of any graph is only a subgraph that keeps all the vertices and is a tree (having no cycle). A graph might have many spanning trees. Figure: A Graph

Algorithm, Example of worse case of time

Example of worse case of time

Rules for abstract data type-tree, null(nil) = true // ...

null(nil) = true // nil refer for empty tree null(fork(e, T, T'))= false // e : element , T and T are two sub tree leaf(fork(e, nil, nil)) = true leaf(

Define game trees, Game trees An interesting application of trees is th...

Game trees An interesting application of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can picture the sequence of possible moves by m

Explain stacks, What are stacks? A stack is a data structure that organ...

What are stacks? A stack is a data structure that organizes data similar to how one organizes a pile of coins. The new coin is always placed on the top and the oldest is on the

linear-expected-time algorithm, Implement a linear-expected-time algorithm...

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

All pairs shortest paths, N = number of rows of the graph D[i[j] = C[i][...

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Define binary tree, Define Binary Tree A binary tree T is explained as...

Define Binary Tree A binary tree T is explained as a finite set of nodes that is either empty or having of root and two disjoint binary trees TL, and TR known as, respectively

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages