Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 3

2 marks

Computer ScienceISC 2022 Computer Science - Specimen paper (Semester 2), Paper 1ConversionData structures

Convert the following notation as directed.

Convert the following infix notation to postfix notation: A * (B + C / D) - E / F

Convert the following infix notation to postfix notation: $A * (B + C / D) - E / F$
Open in the Infix to postfix converter

Answer

Answer

Postfix: $A B C D / + * E F / -$ Working: C/D gives CD/; B+CD/ gives BCD/+; A*(...) gives ABCD/+*; E/F gives EF/; the subtraction gives ABCD/+*EF/-.