Evaluation of a Postfix Expression Multiple choice Questions and Answers (MCQs)

Evaluation of a Postfix Expression Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the other name for a postfix expression?
 A Normal polish Notation B Reverse polish Notation C Warsaw notation D Infix notation
Question 1 Explanation:
Reverse polish Notation is the other name for a postfix expression whereas Polish Notation, Warsaw notation are the other names for a prefix expression.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following is an example for a postfix expression?
 A a*b(c+d) B abc*+de C +ab D a+b-c
Question 2 Explanation:
abc*+de is a postfix expression. +ab is a prefix expression and others are infix expressions.

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Reverse Polish Notation is the reverse of a Polish Notation
 A True B False
Question 3 Explanation:
Reverse Polish Notation is not the reverse of a polish notation. Though both NPN and RPN read the expression from left to right, they follow different strategies.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the time complexity of evaluation of postfix expression algorithm?
 A O (N) B O (N log N) C O (N2) D O (M log N)
Question 4 Explanation:
The time complexity of evaluation of infi, x prefix and postfix expressions is O (N).

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
In Postfix expressions, the operators come after the operands.
 A True B False
Question 5 Explanation:
In postfix expressions, the operators follow operands. In prefix expressions, the operands follow operators.

There are 5 questions to complete.