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

Q. |
## Which of the following is an infix expression? |

A. | (a+b)*(c+d) |

B. | ab+c* |

C. | +ab |

D. | abc+* |

Answer» A. (a+b)*(c+d) |

View all MCQs in:
Data Structures (DS)

- The prefix form of an infix expression (p + q) – (r * t) is?
- 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?
- What is the time complexity of an infix to postfix conversion algorithm?
- In infix to postfix conversion algorithm, the operators are associated from?
- Expression into postfix expression: (A - B) * (D / E)
- To obtain a prefix expression, which of the tree traversals is used?
- 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 data structure required to check whether an expression contains balanced parenthesis is?

Login to Continue

It will take less than 2 minutes

Report MCQ