Bissoy.com
Doctors Medicines MCQs Q&A

While evaluating a postfix expression, when an operator is encountered, what is the correct operation to be performed?

While evaluating a postfix expression, when an operator is encountered, what is the correct operation to be performed? Correct Answer pop 2 operands, evaluate them and push the result on to the stack

When an operator is encountered, the first two operands are popped from the stack, they are evaluated and the result is pushed into the stack.

Related Questions

To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.
Consider two binary operators ‘↑’ and ‘↓’ with the precedence of operator ↓ being lower than that of the operator ↑. Operator ↑ is right associative while operator ↓ is left associative. Which one of the following represents the parse tree for expression (7↓3↑4↑3↓2)?
Consider two binary operators ‘↑’ and ‘↓’ with the precedence of operator ↓being lower than that of the operator ↑. Operator ↑ is right associative while operator ↓ is left associative. Which one of the following represents the parse tree for expression (7 ↓ 3 ↑ 4 ↑ 3 ↓ 2)?
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
The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
The following statements are made regarding the Open Circuit Test on the single-phase transformer: 1. It is performed on the LV side. 2. It is performed at rated current. 3. It helps in the calculation of equivalent leakage impedance. 4. It is performed on the HV side. 5. It is performed at rated voltage. 6. It gives magnetizing current and core loss. 7. It helps in the determination of voltage regulation. 8. It gives the turn ratio. From these, which statements are correct?
Consider the following statements about the doctrine of frustration:
1. Act has become impossible to be performed.
2. Act cannot be performed because of application of some law recently enacted.
3. Act cannot be performed because of the non-availability of raw material.
4. Act cannot be performed by defendant due to his accident.
Which of the statements given above are correct?
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?
Consider evaluating the following expression tree on a machine with load-store Architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
Which of the following data structures is most suitable for evaluating postfix expressions?