- Computer Science Engineering (CSE)
- Data Structure (DS)
- What is the postfix form of the followin...

Q. |
## What is the postfix form of the following prefix expression -A/B*C$DE ? |

A. | abcde$*/- |

B. | a-bcde$*/- |

C. | abc$ed*/- |

D. | a-bcde$*/ |

Answer» A. abcde$*/- |

View all MCQs in:
Data Structure (DS)

- What is the postfix form of the following prefix: *+ab–cd
- The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
- The data structure required to evaluate a postfix expression is
- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
- ……… form of access is used to add and remove nodes from a queue.
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- Which if the following is/are the levels of implementation of data structure
- Which of the following is not the part of ADT description?
- Which of the following data structure can’t store the non-homogeneous data elements?

Login to Continue

It will take less than 2 minutes

Report MCQ