McqMate

Q. |
## In infix to postfix conversion algorithm, the operators are associated from? |

A. | right to left |

B. | left to right |

C. | centre to left |

D. | centre to right |

Answer» B. left to right |

690

0

Do you find this helpful?

6

View all MCQs in

Data Structures (DS)No comments yet

- 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?
- 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?
- The prefix form of an infix expression (p + q) – (r * t) is?
- Which of the following is an infix expression?
- The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
- What is the postfix form of the following prefix expression -A/B*C$DE ?
- The data structure required to evaluate a postfix expression is
- What is the postfix form of the following prefix: *+ab–cd