Q181
Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))?
A.
1
B.
2
C.
3
AnswerD.
4 or more
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board