a-b+c*(d/e-(f+g)) =a-b+c*(/de-(+fg)) =a-b+c*(T-S) where T=/de,S=+fg

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

Question Posted / piyush kumar

33 Answers
61405 Views
Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
E-Mail Answers

Answer Posted / 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 View All Answers

Please Help Members By Posting Answers For Below Questions

List some applications of queue data structure.

979

What’s the difference between enumeration and iterator interfaces?

987

What is huffman’s algorithm?

1147

Does treemap sort on key or value?

949

What's the difference between a hashtable and a hashmap?

973

Can we insert null in hashset?

1148

Is treeset thread safe?

959

What are the properties of binary tree?

957

How do you rotate an AVL tree?

1024

What is type structure?

921

Explain the term run-time stack?

1044

What is the best complexity of bubble sort?

1000

Define a relation?

997

Does concat mutate array?

969

There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?

1330