edited by
7,044 views

2 Answers

Best answer
3 3 votes

Answer : A

Given Expression is (A + B^D ) / (E - F) + G

first we look at precedence and associativity and a/c to that "()" has higher precedence among all operators so we are going to evaluate them first .Lets take this first  (A + B^D ) 

inside this again we have 2 operators one is "+" and other is "^" in which Exponentiation operator has higher precedence .so

it will evaluate it like this

A+ BD^  then  ABD^+ now let move to the second one which is (E - F)  it will be EF- till now we have 

ABD^+  / EF- + G

Now among both operators which has to be evaluated  "/" has higher precedence so we'll evaluate it first 

ABD^+EF- /+ G

now finally we are going to evaluate "+"  

Final Postfix expression will be ABD^+EF-/G+

selected by
0 0 votes

Answer A

For the given expression , postfix notation is

ABD^+EF-/G+

I assume ^+ is merged to ^  in option A.

Hence A is the answer

Answer:
Position:
Show:

Related questions

4 4 votes
5 5 answers
9.5k
9.5k views
Misbah Ghaya asked Jul 18, 2016
9,508 views
How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine $(A ∗ B) + (C ∗ D/E)$? $4$ PUSH and $3$...
4 4 votes
4 answers 4 answers
19.1k
19.1k views
Misbah Ghaya asked Jul 15, 2016
19,105 views
A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there i...
5 5 votes
3 3 answers
8.3k
8.3k views
Misbah Ghaya asked Jul 21, 2016
8,275 views
You have to sort a list $L$, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task...
2 2 votes
1 1 answer
2.2k
2.2k views
Misbah Ghaya asked Jul 24, 2016
2,218 views
Match the following $:$ $\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Call Control protocol} &\text{i.} & \text{Interface betwe...