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 / elle

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

Answer Posted / elle

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
=-ab+*cV
=X+Y where X=-ab,*cV=Y
=+XY
=+-ab*cV
=+-ab*c-TS
=+-ab*c-/de+fg

Is This Answer Correct ?

41 Yes

7 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Difference between abstract data type, data type and data structure?

1046

How to print element of Array?

1038

List the differences between comparable and comparator interface?

924

Is bucket sort stable?

872

Is treemap sorted?

955

How do I push an element into a stack?

864

What is an externalizable interface?

967

Can you sort a string?

788

What is a threaded binary tree? Explain its operation with example?

1137

Why do we need to use computers to help us sort lists?

914

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

1099

Explain extended binary tree.

963

Why is treeset sorted?

982

What is a b+ tree? Explain its uses.

948

What stack means?

911