Computer Science
Abstract Data Types
Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
What will the following pseudocode output when the word brilliant is inputted?
declare a stack of characters
while ( there are more characters in the word to read )
{
read a character
push the character on the stack
}
while ( the stack is not empty )
{
pop a character off the stack
write the character to the screen
}
Consider the stack \(S\), how many items will it have left after the following operations are performed on it?
1 | |