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
59301 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

What is time complexity of sorting algorithms?

887

Can hashmap store null values?

849

Why is data structure needed?

909

Why we use linked list?

853

Why sorting is done?

814

Which programming language is best for data structures?

841

What are the topics in data structures?

956

Can the double-checked locking fail on a single processor system?

973

What is merge sort in daa?

828

What are the advantages of binary search over linear search?

988

What is difference between rb tree and avl tree?

835

What is a hashers run?

844

How do you find the height of a binary tree?

836

Define a right-skewed binary tree?

885

Which is the best book for data structures and algorithms?

830