- Computer Science Engineering (CSE)
- Data Structures (DS)
- Expression into postfix expression: (A -...

Q. |
## Expression into postfix expression: (A - B) * (D / E) |

A. | ABDE - * / |

B. | - * / ABDE |

C. | A B - D E * / |

D. | * - A B / D E |

Answer» D. * - A B / D E |

View all MCQs in:
Data Structures (DS)

- 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?
- Which data structure is needed to convert infix notation to postfix notation?
- 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?
- The Postfix equivalent of the Prefix Notation * + ab - cd is
- The data structure required to check whether an expression contains balanced parenthesis 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