- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- What is the value of the postfix express...

Q. |
## What is the value of the postfix expression 6 3 2 4 + – *? |

A. | 1 |

B. | 40 |

C. | 74 |

D. | -18 |

Answer» D. -18 |

View all MCQs in:
Data Structures (DS)

- Expression into postfix expression: (A - B) * (D / E)
- The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
- The postfix form of A*B+C/D is?
- 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 Postfix equivalent of the Prefix Notation * + ab - cd is
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
- 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