Following is an incorrect pseudocode for the algorithm which is supposed to…
2023
Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced:
declare a character stack
while ( more input is available)
{
read a character
if ( the character is a '(' )
push it on the stack
else if ( the character is a ')' and the stack is not empty )
pop a character off the stack
else
print "unbalanced" and exit
}
print "balanced"
- A.
((())
- B.
())(()
- C.
(()()))
- D.
(()))()
Attempted by 88 students.
Show answer & explanation
Correct answer: A
Ans : A
Explanation:
At the end of while loop, we must check whether the stack is empty or not. For input ((()), the stack doesn't remain empty after the loop