ISRO2020-4

Question

Convert the pre-fix expression to in-fix $- ^{\ast} +ABC^{\ast} – DE+FG$

• A. $(A-B)^{\ast}C+(D^{\ast}E)-(F+G)$
• B. $(A+B)^{\ast}C-(D-E)^{\ast}(F+G)$
• C. $(A+B-C)^{\ast}(D-E)^{\ast}(F+G)$
• D. $(A+B)^{\ast}C-(D^{\ast}E)-(F+G)$

Comments

Option b is correct

---

There was a typo in the official question paper for option B which is fixed now.

---

From right to left scan –

$- * + ABC * -DE \overbrace{+FG}$

$- * + ABC * –DE \overbrace{(F+G)}$

$- * + ABC * \overbrace{(D-E)} \overbrace{(F+G)}$

$- * + ABC  \overbrace{(D-E)*(F+G)}$

$- * \overbrace{(A+B)}C  \overbrace{(D-E)*(F+G)}$

$-  \overbrace{(A+B)*C}  \overbrace{(D-E)*(F+G)}$

$ \overbrace{(A+B)*C-(D-E)*(F+G)}$

Answer 1

$\underline{\textbf{Answer:}\Rightarrow}\;\text{Option B}$

$\mathbf{((A+B)*C)-((D-E)*(F+G)))}$

Answer 2

Infix should be: (((A+B)*C)-((D-E)*(F+G)))

I have tried it here: 

https://ide.geeksforgeeks.org/0C6l9aF7gd 

 

Code source: https://www.geeksforgeeks.org/prefix-infix-conversion/ 

Comments

smsubham

How to calculate infix here ??

what I did was - reverse the expression, so it becomes postfix expression and then evaluate the postfix expression, thus we'll get a tree.

Now do a Inorder traversal on that tree to get Infix expression.

likewise I'm getting - [(G+F) * (E-D)] - [C * (B+A)]

Answer 3

Just scan the operands from right to left and try to keep inside parantheses and update the parentheses as per requirement .

Step1 : (F+G)

Step2:(D-E) (F+G)

Step3:((D-E)*(F+G))

Step4:(skip C for now as we don't get any operator for the consecutive operands i.e. for BC)

Final Step:((A+B)*C)-((D-E)*(F+G))

Hence , Option B is correct.