Question 1

Addition and subtraction have higher precedence when evaluating an infix expression.

Accepted Answer

A) True 
 B)False

Question 2

When evaluating an arithmetic expression, first you transform it from its postfix form to its infix form.

Accepted Answer

A) True 
 B)False

Question 3

To avoid stack overflow, the stack algorithm should raise an error if an item is added to a full stack.

Accepted Answer

A) True 
 B)False

Question 4

Stack interfaces implement a peek operation for examining the element at the top of the stack.

Accepted Answer

A) True 
 B)False

Question 5

When converting from infix form to postfix form, parentheses are added to the equation.

Accepted Answer

A) True 
 B)False

Question 6

A Python list structure and its methods implement a stack perfectly.

Accepted Answer

A) True 
 B)False

Question 7

In a linked structure stack implementation, efficient pushing and popping require adding and removing of nodes at the head of the linked sequence.

Accepted Answer

A) True 
 B)False

Question 8

In the algorithm to evaluate a postfix expression, what does the algorithm do when an operand is encountered?

Accepted Answer

A)   pop the operand from the stack
B)   push the operand onto the stack
C)   pop the operator from the stack
D)   push an operator onto the stackE) B) and C)
F) C) and D)

Question 9

What is the function of the peek method in a stack implementation?

Accepted Answer

A)   to return the bottom item without removing it
B)   to return the top item without removing it
C)   to return the top item and remove it from the stack
D)   to return the bottom item and remove it from the stackE) None of the above
F) C) and D)

Question 10

When using a stack to evaluate the balance of brackets and parentheses in an expression, what is the final step?

Accepted Answer

A)   at the end of the expression, if a final closing bracket is found, the brackets balance
B)   at the end of the expression, if the stack is empty, the brackets do not balance
C)   at the end of the expression, if the stack is full, the brackets balance
D)   at the end of the expression, if the stack is empty, the brackets balanceE) B) and D)
F) B) and C)

Question 11

Using a stack is a good approach to determining if the use of brackets in an expression is balanced.

Accepted Answer

A) True 
 B)False

Question 12

Which of the following is NOT an application of stacks in computer science?

Accepted Answer

A)   implementation of a hash-based database search function
B)   managing computer memory in support of function calls
C)   supporting the undo feature in a text editor
D)   maintaining a history of visited links by a web browserE) B) and D)
F) None of the above

Question 13

In the algorithm that checks for a balanced expression, which of the following is true if a closing bracket is encountered?

Accepted Answer

A)   if the stack is empty, the brackets balance
B)   if the item on the top of the stack is a closing bracket of the same type, the brackets balance
C)   if the stack is empty or the item on the top of the stack is not an opening bracket of the same type, the brackets don't balance
D)   if the stack is empty or the item on the bottom of the stack is an opening bracket of the same type, the brackets balanceE) B) and D)
F) B) and C)

Question 14

In the algorithm to evaluate a postfix expression, what does the algorithm do when an operator is encountered?

Accepted Answer

A)   pop the resulting value from the stack
B)   push the preceding operands onto the stack
C)   apply the operator to the two preceding operands
D)   push the operator onto the stackE) B) and C)
F) A) and D)

Question 15

The time complexity of the postfix expression evaluation algorithm is O( n2 ) .

Accepted Answer

The time complexity of the postfix expre...

Question 16

What is the operation that adds items to a stack?

Accepted Answer

A)   get
B)   set
C)   push
D)   popE) C) and D)
F) None of the above

Question 17

The operation for removing an item from the stack is called push.

Accepted Answer

A) True 
 B)False

Question 18

Which of the following is NOT an operation supported by a stack interface?

Accepted Answer

A)   push
B)   insert
C)   clear
D)   peekE) A) and B)
F) B) and D)

Question 19

The first step in evaluating a postfix expression is to scan the expression from left to right.

Accepted Answer

A) True 
 B)False

Question 20

The Node class for use in the linked structure stack contains three fields: data, next, and previous.

Accepted Answer

A) True 
 B)False

Exam 7: Stacks

When evaluating an arithmetic expression, first you transform it from its postfix form to its infix form.

Correct AnswerverifiedShow Answer

What is the operation that adds items to a stack?

Correct AnswerverifiedShow Answer

The time complexity of the postfix expression evaluation algorithm is O( n2 ) .

Correct AnswerAnswered by ExamLex AIThe time complexity of the postfix expre...View AnswerShow Answer

When using a stack to evaluate the balance of brackets and parentheses in an expression, what is the final step?

Correct AnswerverifiedShow Answer

The Node class for use in the linked structure stack contains three fields: data, next, and previous.

Correct AnswerverifiedShow Answer

In the algorithm that checks for a balanced expression, which of the following is true if a closing bracket is encountered?

Correct AnswerverifiedShow Answer

Using a stack is a good approach to determining if the use of brackets in an expression is balanced.

Correct AnswerverifiedShow Answer

The operation for removing an item from the stack is called push.

Correct AnswerverifiedShow Answer

Stack interfaces implement a peek operation for examining the element at the top of the stack.

Correct AnswerverifiedShow Answer

In a linked structure stack implementation, efficient pushing and popping require adding and removing of nodes at the head of the linked sequence.

Correct AnswerverifiedShow Answer

Addition and subtraction have higher precedence when evaluating an infix expression.

Correct AnswerverifiedShow Answer

What is the function of the peek method in a stack implementation?

Correct AnswerverifiedShow Answer

In the algorithm to evaluate a postfix expression, what does the algorithm do when an operator is encountered?

Correct AnswerverifiedShow Answer

When converting from infix form to postfix form, parentheses are added to the equation.

Correct AnswerverifiedShow Answer

Which of the following is NOT an operation supported by a stack interface?

Correct AnswerverifiedShow Answer

The first step in evaluating a postfix expression is to scan the expression from left to right.

Correct AnswerverifiedShow Answer

Which of the following is NOT an application of stacks in computer science?

Correct AnswerverifiedShow Answer

To avoid stack overflow, the stack algorithm should raise an error if an item is added to a full stack.

Correct AnswerverifiedShow Answer

A Python list structure and its methods implement a stack perfectly.

Correct AnswerverifiedShow Answer

In the algorithm to evaluate a postfix expression, what does the algorithm do when an operand is encountered?

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

The time complexity of the postfix expression evaluation algorithm is O( n² ) .

Correct Answer
Answered by ExamLex AI
The time complexity of the postfix expre...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified