Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))

Answers were Sorted based on User's Feedback



Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / p.divya poojitha

a-b+c*(/de-(+fg))
a-b+c*(t-s) if t=/de;s=+fg
a-b+c*(-ts)
-ab+*c-ts
+-ab*c-ts
sol is +-ab*c-/de+fg

Is This Answer Correct ?    0 Yes 1 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / parneet kaur

+-ab*c-de+fg

Is This Answer Correct ?    0 Yes 1 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / pushpa

*+abc*-/de+fg

Is This Answer Correct ?    3 Yes 6 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / badri

*+-abc-/de+fg

Is This Answer Correct ?    15 Yes 19 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / neha munjral

*-+abc/de+fg

Is This Answer Correct ?    0 Yes 5 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / sudip chatterjee

-a+b*c-/de+fg

Is This Answer Correct ?    3 Yes 9 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / deepshikha singh

first we solve() because it has greatest priority
step1 : a-b+c*(d/e-[+fg])
step2 : a-b+c*([/de]-[+fg])
step3 : a-b+c*[-/de+fg]
step4 : a-b+[*c-/de+fg]
step5 : a-[+b*c-/de+fg]
step6: -a+b*c-/de+fg
note :[] sign is use to differentiate two terms after applying
operations.

Is This Answer Correct ?    3 Yes 9 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / rohit verma

-a+*c-/de+fg

Is This Answer Correct ?    6 Yes 17 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / amit patra

=a-b+c*(d/e-(+fg)
=a-b+c*(/de-(+fg)
=a-b+c*(-/de+fg)
=a-b+c*-de+fg
=-ab+c*-de+fg
=*-+abcde+fg

Is This Answer Correct ?    1 Yes 13 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / piyush kumar

a-b+c*(d/e-(f+g))
=a-b+c*(/de-(+fg))
=a-b+c*(T-S) where T=/de,S=+fg
=a-b+c*-(TS)
=-ab+c*-(TS)
=-ab+c*V where V=-TS
=X+Y where X=-ab,c*V=Y
=+XY
=+-abc*V
=+-abc*-TS
=+-abc*-/de+fg

Is This Answer Correct ?    3 Yes 16 No

Post New Answer

More Data Structures Interview Questions

What is circular queue example?

0 Answers  


What are scalar values?

0 Answers  


Write the stack overflow condition.

0 Answers  


What is hashing technique? Describe in brief.

0 Answers  


What is an externalizable interface?

0 Answers  


Does treemap sort automatically?

0 Answers  


What is complexity of bubble sort?

0 Answers  


When will you sort an array of pointers to list elements, rather than sorting the elements themselves?

5 Answers  


What is example of data?

0 Answers  


Define a complete binary tree?

0 Answers  


When would you use a tuple?

0 Answers  


Why do we use dynamic arrays?

0 Answers  


Categories