ISRO2009-28

Question

The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as

• A. $A+B-C^*D$
• B. $+A^*-BCD$
• C. $ABC-D^*+$
• D. $A+BC-D^*$

Answer 1

Option B 

Scan Right to Left

Stack : * ) -

Pop - ) by seeing (

Stack: *

Pop * as incoming is +

Stack : +

Output : +A*-BCD

Answer 2

(  ) has highest priority then * then +.

so whatever inside the bracket will be evaluated first

A+(−BC) *D

A+((−BC) *D))

A+(*−BCD)

(A+(*−BCD))

+A*−BCD

OPTION B