adplus-dvertising
frame-decoration

Question

Convert the following infix expression to postfix expression -
A / B ^ C + D * E - A * C

a.

A B C / ^ D E * + A C * -

b.

A B C ^ / D * E + A C * -

c.

A B C ^ / D E * + A * C -

d.

A B C ^ / D E * + A C * -

Answer: (d).A B C ^ / D E * + A C * -

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Convert the following infix expression to postfix expression - A / B ^ C + D * E - A * C

Similar Questions

Discover Related MCQs

Q. Convert the following infix expression to postfix expression -
B * C - C + D / A / ( E + E )

Q. In Computer generally _________ expressions are preferred.

Q. Data Structure required to evaluate infix to postfix is __________.

Q. What will be the postfix form of the above expression -
(A+B)∗(C∗D-E)∗F/G

Q. If the sequence of operations -

push(1)
push(2)
pop
push(1)
push(2)
pop
pop
pop
push(2)
pop

are performed on a stack, the sequence of popped out values are ?

Q. Stack cannot be used to

Q. Expression
1 * 2 ^ 3 * 4 ^ 5 * 6
is evaluated as -

Q. Which of the following is useful in the implementation of quick sort ?

Q. List of data in which element can be inserted and removed at the same end is called as __________.

Q. Adding element to stack means ___________.

Q. Pushing element in the stack means _____________.

Q. Post fix form of following infix expression is -
(A + B) * (C + D - E) * F

Q. Post fix form of following infix expression is -
* + A B - C D

Q. Stack can be implemented using ___________ and _________.

Q. Well formed parenthesis can be checked using following data structure ?

Q. Post fix form of
A + (B * C)
is -

Q. Post fix form of -
(A + B) * C

Q. Consider following Scenario -

1. The five items : P,Q,R,S and T are inserted into stack A one after other starting from T in reverse order.

2. The stack is popped three times and each element is inserted into another stack B.

3. Then two elements are deleted from the stack B and pushed back onto the stack A.

What are the topmost elements of stack A and Stack B respectively?

Q. If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before stack overflow?

Q. Stack A has 3 Elements in it Say X,Y and Z with X on top.

1. Stack B is empty.
2. An Element popped out from Stack A can be printed immediately or pushed to stack B.
3. An Element popped out from Stack B can only be printed.

In this arrangement, which of the following permutations of X,Y,Z are not possible ?