- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- The data structure required to check whe...

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 |

View all MCQs in:
Data Structures (DS)

- 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?
- What should be done when a left parenthesis ‘(‘ is encountered?
- 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?
- New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
- Which data structure allows deleting data elements from front and inserting at rear?
- Why we need to a binary tree which is height balanced?
- What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

Login to Continue

It will take less than 2 minutes

Report MCQ