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?

Home / Engineering / Data Structure (DS) / Question

Mr. Dubey • 51.43K Points
Coach

Q.) 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?

(A) 1

(B) 2

(D) none

Correct answer : Option (B) - 2

Discusssion

Related MCQs on Data Structure (DS)

Q. A network can have only one source and one sink.

Q. A song being played on computer speaker is

Q. PLA is used to implement

Q. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Q. Programmers prefer programming to testing and sometimes they take shortcuts when writing tests. For example, they may write incomplete tests that do not check for all possible exceptions that may occur.

Q. Absolute time ordering of all shared accesses matters in

Q. The highest noise margin is offered by

Q. The two phase locking protocol consists of

Q. Sequential circuit includes

Q. If L and L¯ are recursively enumerable, then L is