+1 vote
in Data Structures & Algorithms I by (110k points)
Evaluation of infix expression is done based on precedence of operators.

(a) True

(b) False

My doubt stems from Evaluation of an Infix Expression (Not Parenthesized) topic in division Application of Stacks of Data Structures & Algorithms I

The question was asked during an online interview.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
The correct choice is (a) True

Best explanation: During evaluation of infix expression, the operators with higher precedence are evaluated first, followed by operators with lower precedence.

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.