Evaluation of a Postfix Expression Multiple choice Questions and Answers (MCQs)
What is the other name for a postfix expression?
Normal polish Notation
Reverse polish 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.
Which of the following is an example for a postfix expression?
Question 2 Explanation:
abc*+de is a postfix expression. +ab is a prefix expression and others are infix expressions.
Reverse Polish Notation is the reverse of a Polish Notation
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.
What is the time complexity of evaluation of postfix expression algorithm?
O (N log N)
O (M log N)
Question 4 Explanation:
The time complexity of evaluation of infi, x prefix and postfix expressions is O (N).
In Postfix expressions, the operators come after the operands.
Question 5 Explanation:
In postfix expressions, the operators follow operands. In prefix expressions, the operands follow operators.
There are 5 questions to complete.