+1 vote
in Data Structures & Algorithms I by (110k points)
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?

(a) abc X+ def ^^ –

(b) abc X+ de^f^ –

(c) ab+c Xd – e ^f^

(d) -+aXbc^ ^def

Please solve with an explanation.

1 Answer

+1 vote
by (550k points)
selected by
 
Best answer
Correct option is (b) abc X+ de^f^ –

Easy explanation - Given Infix Expression is a + b X c – d ^ e ^ f.

(a b c X +) (d ^ e ^ f). ‘–‘ is present in stack.

(a b c X + d e ^ f ^ -). Thus the final expression is (a b c X + d e ^ f ^ -).

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

...