PRASHNIKAप्रश्निका
Back to the paper

Convert the following *infix* notation to *postfix* form.

Computer Science20252 marksOne word
Convert the following *infix* notation to *postfix* form. $(A * B\text{^}C) + (D * E) \quad \text{where } B\text{^}C = B^C$

Answer

Answer

AI
$(A * B\text{^}C) + (D * E)$ Since ^ (exponentiation) has the highest precedence and is right-associative, evaluate B^C first: $B\ C\ \text{^}$ Then $A*(B\text{^}C) \to A\ B\ C\ \text{^}\ *$ $D*E \to D\ E\ *$ Combine both operands of the outer + : Postfix: $A\ B\ C\ \text{^}\ *\ D\ E\ *\ +$
Data structures

From ISC 2025 Improvement Computer Science Paper 1, question 2(i).