- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- Which of the following statement is inco...

Q. |
## Which of the following statement is incorrect with respect to infix to postfix conversion algorithm? |

A. | operand is always placed in the output |

B. | operator is placed in the stack when the stack operator has lower precedence |

C. | parenthesis are included in the output |

D. | higher and equal priority operators follow the same condition |

Answer» C. parenthesis are included in the output |

View all MCQs in:
Data Structures (DS)

- What is the time complexity of an infix to postfix conversion algorithm?
- In infix to postfix conversion algorithm, the operators are associated from?
- Which data structure is needed to convert infix notation to postfix notation?
- Which of the following is an infix expression?
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- The prefix form of an infix expression (p + q) – (r * t) 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?
- The Postfix equivalent of the Prefix Notation * + ab - cd is

Login to Continue

It will take less than 2 minutes

Report MCQ