UTpaper

Free mock tests & test series

Question 34Asked in UGC NET Computer Science, June 2014 (Paper II & III, Selected Questions)

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

  1. AA B + C * D + EF + G +
  2. BA B + C D * + E F + G +
  3. CA B + C * D + E F G + +
  4. DA B + C* D + E + F G +
Show answerHide answer

Correct answer: (A) A B + C * D + EF + G +

Explanation

((A + B) ∗ C + D) / (E + F + G) → (AB+ ∗ C + D) / (E + F + G) → (AB+C∗ + D) / (E + F + G) → AB+C∗D+ / (EF+ + G) → AB+C∗D+ / EF+G+ → AB+C∗D+EF+G+/ Hence, the answer is (a).

From UGC NET Computer Science PYQ, June 2014 (Paper II & III, Selected Questions)

This is question 34 of UGC NET Computer Science PYQ, June 2014 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.