- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- What should be done when a left parenthe...

Q. |
## What should be done when a left parenthesis ‘(‘ is encountered? |

A. | It is ignored |

B. | It is placed in the output |

C. | It is placed in the operator stack |

D. | The contents of the operator stack is emptied |

Answer» C. It is placed in the operator stack |

View all MCQs in:
Data Structures (DS)

- The data structure required to check whether an expression contains balanced parenthesis is?
- 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?
- If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
- When an operand is read, which of the following is done?
- A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
- The topological sorting of any DAG can be done in time.
- Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?

Login to Continue

It will take less than 2 minutes

Report MCQ