McqMate

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 - * |

2.9k

0

Do you find this helpful?

23

View all MCQs in

Data Structures (DS)No comments yet

- Which data structure is needed to convert infix notation to postfix notation?
- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
- What is the postfix form of the following prefix expression -A/B*C$DE ?
- What is the postfix form of the following prefix: *+ab–cd
- The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
- The data structure required to evaluate a postfix expression is
- 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?