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
- 59302 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
Answer Posted / p.divya poojitha
a-b+c*(/de-(+fg))
a-b+c*(t-s) if t=/de;s=+fg
a-b+c*(-ts)
-ab+*c-ts
+-ab*c-ts
sol is +-ab*c-/de+fg
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
What is best time complexity?
Can we use Generics with the array?
What is comparable interface?
What is the use of isEmpty() member methods?
Why do we use trees in data structures?
What are the advantage of linked list over array?
Define root?
Define the term “percolate down”?
How to copy an array into another array?
Define back edge?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
Can you have an arraylist of arrays?
Is list an array?
Which sorting technique is faster?
What are arrays used for?
