recategorized by
5,273 views
1 1 vote

The reverse polish notation equivalent to the infix expression $((A + B) ^{*} C + D)/(E + F + G)$

  1. $A B + C ^{*} D + EF + G + /$ 
  2. $A B + C D ^{*} + E F + G + /$ 
  3. $A B + C ^{*} D + E F G + +/$ 
  4. $A B + C ^{*} D + E + F G + /$ 

1 Answer

3 3 votes

( ( A + B ) * C + D ) / ( E + F + G )

(  A  B + * C + D ) / ( E + F + G )

(  A  B +  C * + D ) / ( E + F + G )

 A  B +  C *  D +  /  ( E + F + G )

 A  B +  C *  D ) +  /  ( E  F + + G )

  A  B +  C *  D +  /   E  F +  G +

  A  B +  C *  D +    E  F +  G + /

Hence,Option(A)  A  B +  C *  D +    E  F +  G +  /  is the correct choice.

Answer:
Position:
Show:

Related questions

0 0 votes
2 2 answers
2.8k
2.8k views
Misbah Ghaya asked Jul 11, 2016
2,811 views
If $h$ is chosen from a universal collection of hash functions and is used to hash $n$ keys into a table of size $m$, where $n \leq m$, the expected number of collisions ...
0 0 votes
3 3 answers
2.7k
2.7k views
Misbah Ghaya asked Jul 12, 2016
2,698 views
Suppose that the splits at every level of quicksort are in the proportion $(1 – \alpha)$ to $\alpha$, where $0<\alpha\leq\frac{1}{2}$ is a constant. The minimum depth of ...
4 4 votes
3 answers 3 answers
8.9k
8.9k views
Shimpy Goyal asked Jun 26, 2015
8,908 views
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by$( ( ) \; ( ( ) ) \; ( ( ) ) ...
3 3 votes
2 answers 2 answers
7.3k
7.3k views
go_editor asked Jan 6, 2017
7,340 views
Four bits are used for packed sequence numbering in a slinding window protocol used in a computer network. What is the maximum window size?481516