Category Archives: infix

Convert the following infix expression into its postfix form (A/B+C) * (D/(E-F)) =(A/B+C) (D/(E-F))* =(AB/+C) (D/(EF-))* =(AB/C+) (DEF-/)* =AB/C+DEF-/*

convert the following infix notation to its postfix formE * (F / (G – H) * I) + J = E *(F / GH – *I) + J= E * FGH – / * + J= EFGH – / I … Continue reading →

Convert the following infux notation to its postfix form A (B + C) + (D + E) * F) / G = A + (BC++DE + *F) / G =A +(BC+ +DE + F*) /G = A + BC + … Continue reading →

Convert the following infix expression to its postfix form a + b * c  – d / e input      action         stack status   output c             push           c                    a             print           c                    a +            push           c+                 a b            print           c+                 ab *            push           … Continue reading →

Convert the following infix notation to postfix form: (A + B * C ) – ( E * F / H ) + J = ( A + BC* ) – ( EF* / H ) + J = ( … Continue reading →

Convert the following infix notation to postfix form: A + (B – C * (D / E) * F) = A + (B – C * DE/ * F) = A + (B- CDE/* * F) =A + (BCDE/*F*-) ABCDE/*F*-+

Convert the following infix expression to postfix form: P * Q / R + (S + T) = P * Q / R + ST+ = P Q* / R + ST+ = PQ*R/ + ST+ P Q * R … Continue reading →

Convert the following infix expression to postfix form: A + B / C * (D / E * F) A + B / C * ( D / E * F ) = A + B / C * ( … Continue reading →

Convert the following infix notation into postfix form: X + ( Y-Z ) +(( W + E) * F ) / J = X+ ( Y -Z ) +( ( W + E) * F ) / J = X … Continue reading →