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
- 59581 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
Answer Posted / rodel
given-> a - b + c * (d / e - (f + g))
note: remember, before we do the infix expression to postfix expression.
We analyze the given data by using the hierarchy of operation (PEMDAS)
In that way, we can do the operation, tracing the hierarchy nos...
sample:
a - b + c * (d / e - (f + g))
5 6 4 2 3 1
pass1: a - b + c * (d / e - (f g +)) infix -> postfix
pass2: a - b + c * (d e / - f g +) infix -> postfix
pass3: a - b + c * (d e / - f g +) infix -> postfix
pass4: a - b + c * (d e / f g + - ) infix -> postfix
pass5: a b - + c d e / f g + - * infix -> postfix
pass6: a b - c + d e / f g + - * infix -> postfix -> Final Answer
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What does arrays tostring do?
What are the types of queues?
What do u mean by array?
Is tuple immutable?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
Is quicksort faster than merge sort?
What are the parts of a linked list?
What is the method to find the complexity of an algorithm?
Why do we need searching algorithms?
What is binary tree and its types?
How do we search a specific element in an array?
Is hashmap faster than arraylist?
Explain the priority queue?
What is difference between static and dynamic array?
What is difference between arraylist and list?
