edited by
6,125 views

2 Answers

Best answer
3 votes
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 votes
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:

Related questions

4 votes
4 votes
3 answers
2
makhdoom ghaya asked Jul 15, 2016
15,861 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...
4 votes
4 votes
3 answers
3
0 votes
0 votes
1 answer
4
go_editor asked Mar 26, 2020
317 views
What is the time required to insert an element in a stack with linked implementation?$O \left(\log_{2}n \right)$$O \left(n \right)$$O \left(n \log_{2}n \right)$$O \left(1...