- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- The prefix form of an infix expression (...

Q. |
## The prefix form of an infix expression (p + q) – (r * t) is? |

A. | + pq – *rt |

B. | – +pqr * t |

C. | – +pq * rt |

D. | – + * pqrt |

Answer» C. – +pq * rt |

View all MCQs in:
Data Structures (DS)

- Which of the following is an infix expression?
- To obtain a prefix expression, which of the tree traversals is used?
- 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 prefix form of A-B/ (C * D ^ E) is?
- Expression into postfix expression: (A - B) * (D / E)
- The Postfix equivalent of the Prefix Notation * + ab - cd is
- The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

Login to Continue

It will take less than 2 minutes

Report MCQ