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.30K 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. In reinforcement learning if feedback is negative one it is defined as____.

Q. Retirement phase is

Q. What is the network ID for a computer whose IP address is 190.148.64.23?

Q. If two constraints do not intersect in the positive quadrant of the graph, then

Q. If an attribute of a composite key is dependent on an attribute of the other composite key, normalization called ................ is needed.

Q. Which of the following is not a flowchart structure?

Q. Which NetWare protocol works on layer 3–network layer—of the OSI model?

Q. The following combination is correct for an ODD parity data transmission system: data = 011011100 and parity = 0

Q. The object of ___________within an OO system is to design tests that have a high likelihood of uncovering plausible bugs.