Bissoy.com
Doctors Medicines MCQs Q&A

What is the postfix representation of the following infix expression? (A + B) * C – D * E / F

What is the postfix representation of the following infix expression? (A + B) * C – D * E / F Correct Answer A B + C * D E * F / -

Concept:

() has highest precedence

* and / has same precedence while + and – has same precedence

(* and /) and higher precedence than (+, -)

Associativity is left to right:

Explanation:

(A + B) * C – D * E / F

A B + * C – D * E / F

A B + C * – D * E / F

A B + C * – D E * / F

A B + C * – D E * F /

A B + C * D E * F / –

Related Questions

Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.
Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?
Convert the following Infix expression to Postfix form using a stack. x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.
Which of the following data structure is used to convert postfix expression to infix expression?
The postfix expression abc+de/*- is equivalent to which of the following infix expression?
Assume that the operators +,-, X are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is?
It is easier for a computer to process a postfix expression than an infix expression.
Consider the postfix expression 4 5 6 a b 7 8 a c, where a, b, c are operators. Operator a has higher precedence over operators b and c. Operators b and c are right associative. Then, equivalent infix expression is
Which of the following applications may use a stack? (a) Parenthesis balancing program (b) Process scheduling operating system (c) Conversion of infix arithmetic expression to postfix form