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 / C) + (D * E / F) * G$

Answer

Answer

AI
$(A - B / C) + (D * E / F) * G$ Using operator precedence ($*$, $/$ before $-$, $+$) and left-to-right evaluation: $(A - B/C) \to A\ B\ C\ /\ -$ $(D*E/F)*G \to D\ E\ *\ F\ /\ G\ *$ Combining the two with $+$: Postfix: $A\ B\ C\ /\ -\ D\ E\ *\ F\ /\ G\ *\ +$
Data structures

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