McqMate

Q. |
## The data structure required to check whether an expression contains balanced parenthesis is? |

A. | Stack |

B. | Queue |

C. | Array |

D. | Tree |

Answer» A. Stack |

3.4k

0

Do you find this helpful?

32

View all MCQs in

Data Structures (DS)No comments yet

- The data structure required to check whether an expression contains balanced parenthesis is?
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
- The data structure required to evaluate a postfix expression is
- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
- What should be done when a left parenthesis ‘(‘ is encountered?
- Which of the following data structure is not linear data structure?
- Which of the following data structure is linear data structure?
- Expression into postfix expression: (A - B) * (D / E)
- The data structure required for Breadth First Traversal on a graph is?
- To perform level-order traversal on a binary tree, which of the following data structure will be required?