AMU 2026 — Computer PYQ

To convert an infix expression to a postfix expression, we must follow the rules of operator precedence and associativity, resolving the innermost parenthesized expressions first.

Given Infix Expression:

$$((A+B)-C\ast (D/E))+F$$

Let us break down and convert the expression step-by-step using brackets to establish precedence:

1. Step 1: Convert the innermost sub-expressions inside parentheses

   • First innermost term is $(A+B)$, which becomes:

     $$(AB+)$$

   • Second innermost term is $(D/E)$, which becomes:

     $$(DE/)$$

   Substituting these back into our expression gives:

   $$((AB+)-C\ast (DE/))+F$$

2. Step 2: Resolve the multiplication operator ($\ast$)

   • The multiplication operator $\ast$ has higher precedence than subtraction ($-$). It operates on the operand $C$ and the sub-expression $(DE/)$.

   • Therefore, $C\ast (DE/)$ becomes:

     $$(CDE/\ast )$$

   Substituting this back into the expression:

   $$((AB+)-(CDE/\ast ))+F$$

3. Step 3: Resolve the subtraction operator ($-$) inside the main bracket

   • Now, we convert the operation between the two remaining parts inside the outer parentheses: $(AB+)-(CDE/\ast )$.

   • Moving the operator to the end gives:

     $$(AB+CDE/\ast -)$$

   Our expression now simplifies to:

   $$(AB+CDE/\ast -)+F$$

4. Step 4: Resolve the final addition operator ($+$)

   • Finally, we convert the operation between the large sub-expression and $F$.

   • Moving the final $+$ to the end gives:

     $$AB+CDE/\ast -F+$$

Conclusion:

The fully evaluated postfix expression is $AB+CDE/\ast -F+$, which matches option (a).