Abstract Data Types on Data Structure and Algorithms related Questions and Answers


Question :   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

1. abc X+ def ^^ –
2. abc X+ de^f^ –
3. ab+c Xd – e ^f^
4. -+aXbc^ ^def
Answer :   1 - abc X+ def ^^ –  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter