- Computer Science Engineering (CSE)
- Data Structures (DS)
- The Postfix equivalent of the Prefix Not...

Q. |
## The Postfix equivalent of the Prefix Notation * + ab - cd is |

A. | ab + cd - * |

B. | abcd +-* |

C. | ab+cd*- |

D. | ab+-cd* |

Answer» A. ab + cd - * |

View all MCQs in:
Data Structures (DS)

- Which data structure is needed to convert infix notation to postfix notation?
- What is the value of the postfix expression 6 3 2 4 + – *?
- The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
- The postfix form of A*B+C/D is?
- What is the time complexity of an infix to postfix conversion algorithm?
- Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
- In infix to postfix conversion algorithm, the operators are associated from?
- Expression into postfix expression: (A - B) * (D / E)
- The prefix form of A-B/ (C * D ^ E) is?
- The prefix form of an infix expression (p + q) – (r * t) is?

Login to Continue

It will take less than 2 minutes

Report MCQ