## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

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

Question 1 |

What is the other name for a postfix expression?

Normal polish Notation | |

Reverse polish Notation | |

Warsaw notation | |

Infix notation |

**Puzzles Questions answers**

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 |

Which of the following is an example for a postfix expression?

a*b(c+d) | |

abc*+de | |

+ab | |

a+b-c |

**Aptitude test Questions answers**

Question 2 Explanation:

abc*+de is a postfix expression. +ab is a prefix expression and others are infix expressions.

Question 3 |

Reverse Polish Notation is the reverse of a Polish Notation

True | |

False |

**GK Questions answers**

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 |

What is the time complexity of evaluation of postfix expression algorithm?

O (N) | |

O (N log N) | |

O (N ^{2}) | |

O (M log N) |

**Public administration Questions answers**

Question 4 Explanation:

The time complexity of evaluation of infi, x prefix and postfix expressions is O (N).

Question 5 |

In Postfix expressions, the operators come after the operands.

True | |

False |

**UPSC test Questions answers**

Question 5 Explanation:

In postfix expressions, the operators follow operands. In prefix expressions, the operands follow operators.

There are 5 questions to complete.