Question 1

When using a stack to determine if brackets are balanced in an expression, the stack should not be empty when you reach the end of the expression.

Accepted Answer

A) True 
 B)False

Question 2

What protocol are stacks said to adhere to?

Accepted Answer

A)  LIFO 
B)  FIFO 
C)  one-to-one 
D)  many-to-one 
A)  LIFO 
B)  FIFO 
C)  one-to-one 
D)  many-to-one

Question 3

Which of the following is true about stacks?

Accepted Answer

A)  they are analogous to a row of books on a shelf 
B)  items are always added to the bottom 
C)  access is restricted to just one end 
D)  most implementations allow access to the middle 
A)  they are analogous to a row of books on a shelf 
B)  items are always added to the bottom 
C)  access is restricted to just one end 
D)  most implementations allow access to the middle

Question 4

What are the two fields required by the Node class in the linked implementation of a stack?

Accepted Answer

A)  prev, items 
B)  prev, data 
C)  items, next 
D)  data, next 
A)  prev, items 
B)  prev, data 
C)  items, next 
D)  data, next

Question 5

If the portion of the postfix expression scanned so far is 7 6 2 +, what is the result when the operator is applied to the operands?

Accepted Answer

A)  8 
B)  15 
C)  13 
D)  9 
A)  8 
B)  15 
C)  13 
D)  9

Question 6

What is the first step in the algorithm to evaluate an arithmetic expression?

Accepted Answer

A)  transform the expression from postfix form to infix form 
B)  calculate the result from the postfix expression 
C)  calculate the result from the infix expression 
D)  transform the expression from infix form to postfix form 
A)  transform the expression from postfix form to infix form 
B)  calculate the result from the postfix expression 
C)  calculate the result from the infix expression 
D)  transform the expression from infix form to postfix form

Question 7

A tuple is an immutable collection type.

Accepted Answer

The answer of A tuple is an immutable collection type....

Question 8

Because of their linear structure, stacks can only be implemented using linked structures.

Accepted Answer

A) True 
 B)False

Question 9

The pop operation for a stack raises an error if the stack is empty.

Accepted Answer

A) True 
 B)False

Question 10

The operator in a postfix expression follows the operands.

Accepted Answer

A) True 
 B)False

When using a stack to determine if brackets are balanced in an expression, the stack should not be empty when you reach the end of the expression.

What protocol are stacks said to adhere to?

Which of the following is true about stacks?

What are the two fields required by the Node class in the linked implementation of a stack?

If the portion of the postfix expression scanned so far is 7 6 2 +, what is the result when the operator is applied to the operands?

What is the first step in the algorithm to evaluate an arithmetic expression?

A tuple is an immutable collection type.

Because of their linear structure, stacks can only be implemented using linked structures.

The pop operation for a stack raises an error if the stack is empty.

The operator in a postfix expression follows the operands.

Basic Python Programming

An Overview of Collections

Searching, Sorting, and Complexity Analysis

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Queues

Lists

Trees

Sets and Dictionaries

Graphs

Filters

Exam 7: Stacks

When using a stack to determine if brackets are balanced in an expression, the stack should not be empty when you reach the end of the expression.

What protocol are stacks said to adhere to?

Which of the following is true about stacks?

What are the two fields required by the Node class in the linked implementation of a stack?

If the portion of the postfix expression scanned so far is 7 6 2 +, what is the result when the operator is applied to the operands?

What is the first step in the algorithm to evaluate an arithmetic expression?

A tuple is an immutable collection type.

Because of their linear structure, stacks can only be implemented using linked structures.

The pop operation for a stack raises an error if the stack is empty.

The operator in a postfix expression follows the operands.

Basic Python Programming

An Overview of Collections

Searching, Sorting, and Complexity Analysis

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Queues

Lists

Trees

Sets and Dictionaries

Graphs

Filters