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
- 60483 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
Is linkedlist thread safe?
How many sorting techniques are there?
Which is the parent class of printerstatereasons class?
Explain recursive function & what is the data structures used to perform recursion?
Two linked lists are given, find out the sum of them without altering the linked list?
In depth questions regarding the data structures and the Databases used in the Projects developed.
What is the limit of arraylist?
Which is the parent class of linkedhashset class?
How many passes does bubble sort need?
What is the need for path compression?
Define structure property in a heap?
What do you mean by open addressing?
Is hashtable throw concurrentmodificationexception?
What is the best case time complexity of bubble sort?
What is a sorting algorithm in data structure?
