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?

M

Mr. Dubey • 52.26K 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

(C) none

(D) none

Correct : Option (B)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. What are the different Algorithm techniques in Machine Learning?

Q. Naive prediction is

Q. Suppose that you invest $1 for 1 year at 18% compounded monthly. How much interest would you earn?

Q. If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will

Q. Data compression includes

Q. Select the name of the predefined column in SQL 3 that contains row identifiers, which can be used as values in other rows.

Q. Defect is a technique that was developed to estimate the number of defects resident in a piece of software.

Q. This supervised learning technique can process both numeric and categorical input attributes.

Q. CometCloud supports policy based autonomic and

Q. The following is the direct tax among: