McqMate

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 |

1.3k

0

Do you find this helpful?

19

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following is an infix expression?
- 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 ?
- 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?
- What is the postfix form of the following prefix: *+ab–cd
- The prefix form of A-B/ (C * D ^ E) is?