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))
- 33 Answers
- 59686 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Explain what is a spanning tree?
What are the different types of data type?
Is hashmap a data structure?
Can binary tree have 1 child?
Can we put null value in hashmap?
What is the basic of data structure?
List the data structures which are used in hierarchical data model.
How is a queue works?
What is ascii sort order?
What is array in data structure with example?
What is a hashmap in c?
Define union-by-weight?
Which collection is fail safe?
What is map keyset?
How many types of data structures are there?
