+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?

(a) Operand is pushed on to the stack

(b) If the precedence of operator is higher, pop two operands and evaluate

(c) If the precedence of operator is lower, pop two operands and evaluate

(d) The result is pushed on to the operand stack

My enquiry is from Evaluation of an Infix Expression (Not Parenthesized) topic in chapter Application of Stacks of Data Structures & Algorithms I

This question was posed to me in an interview.

1 Answer

+1 vote
by (444k points)
selected by
 
Best answer
The correct option is (b) If the precedence of operator is higher, pop two operands and evaluate

The explanation is: If the precedence of the operator is higher than the stack operator, then it is pushed on to the stack operator.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...