Question 1

What is the restriction that the array-based implementation of a stack places on the push operation?

Accepted Answer

The restriction that is placed by the array-based implementation of a stack is that it prevents the push operation from adding an item to the stack if the stack's size limit,which is the size of the array,has been reached.

Question 2

When infix expressions are converted to postfix expressions,the operands always stay in the same order with respect to one another.

Accepted Answer

A) True 
 B)False  True

Question 3

The ______ method of the ADT stack retrieves the top of the stack,but does not change the stack.

Accepted Answer

A) createStack 
B) push 
C) pop 
D) peek 
A) createStack 
B) push 
C) pop 
D) peek D

Question 4

Which of the following strings contains balanced braces?

Accepted Answer

A) ab{cde{fg}hi{jkl} 
B) ab{cde{fghi}j}kl} 
C) {abc{de}{fg}hij}kl 
D) {ab{cde{fgh}ijkl} 
A) ab{cde{fg}hi{jkl} 
B) ab{cde{fghi}j}kl} 
C) {abc{de}{fg}hij}kl 
D) {ab{cde{fgh}ijkl}

Question 5

Suppose an infix expression contains parentheses as grouping symbols.Is it still possible to convert this expression into postfix notation?

Accepted Answer

Yes.The al

Question 6

What are the factors which determine the placement of operators when an infix expression is converted to a postfix expression?

Accepted Answer

The factors which determine th

Question 7

The last-in,first-out (LIFO)property is found in the ADT ______.

Accepted Answer

A) list 
B) stack 
C) queue 
D) tree 
A) list 
B) stack 
C) queue 
D) tree

Question 8

A program can use the operations of the ADT stack without knowing how the operations are implemented.

Accepted Answer

A) True 
 B)False

Question 9

Calls to methods that throw StackException must be enclosed in try blocks.

Accepted Answer

A) True 
 B)False

Question 10

What is an exhaustive search?

Accepted Answer

An exhaustive search is a sear

Question 11

In a reference-based implementation of a stack,it is necessary to call the isFull method before calling the push method.

Accepted Answer

A) True 
 B)False

Question 12

In a reference-based implementation of a stack,the stack can grow and shrink dynamically.

Accepted Answer

A) True 
 B)False

Question 13

When does the push operation throw a StackException?

Accepted Answer

The push operation throws a St

Question 14

A client can access all the elements of a stack.

Accepted Answer

A) True 
 B)False

Question 15

What is the corrected input if the following line is typed on a keyboard: yww←dshr←←wd←e
(where ← represents the backspace character)?

Accepted Answer

A) ywdswe 
B) ywwdwde 
C) ywdshwe 
D) ywdswd 
A) ywdswe 
B) ywwdwde 
C) ywdshwe 
D) ywdswd

Question 16

In the StackInterface class,the push method accepts as its parameter an item that is an instance of ______.

Accepted Answer

A) Integer 
B) Double 
C) String 
D) Object 
A) Integer 
B) Double 
C) String 
D) Object

Question 17

An algorithm that uses a stack to implement a nonrecursive solution to the HPAir problem reaches the conclusion that there is no path from an origin city to a destination city only after ______.

Accepted Answer

A) the algorithm has backtracked to the origin 
B) the algorithm has backtracked to the origin and there remain no unvisited cities to fly to from the origin 
C) the algorithm has reached a city and there remain no unvisited cities to fly to from that city 
D) the algorithm has reached the destination and there remain no unvisited cities to fly to from the destination 
A) the algorithm has backtracked to the origin 
B) the algorithm has backtracked to the origin and there remain no unvisited cities to fly to from the origin 
C) the algorithm has reached a city and there remain no unvisited cities to fly to from that city 
D) the algorithm has reached the destination and there remain no unvisited cities to fly to from the destination

Question 18

A stack has a first in,first out property.

Accepted Answer

A) True 
 B)False

Question 19

What is meant by the last-in,first-out (LIFO)property?

Accepted Answer

The LIFO property is a propert

Question 20

The ______ method of the ADT stack retrieves and then removes the top of the stack.

Accepted Answer

A) createStack 
B) push 
C) pop 
D) peek 
A) createStack 
B) push 
C) pop 
D) peek

What is the restriction that the array-based implementation of a stack places on the push operation?

When infix expressions are converted to postfix expressions,the operands always stay in the same order with respect to one another.

The ______ method of the ADT stack retrieves the top of the stack,but does not change the stack.

Which of the following strings contains balanced braces?

Suppose an infix expression contains parentheses as grouping symbols.Is it still possible to convert this expression into postfix notation?

What are the factors which determine the placement of operators when an infix expression is converted to a postfix expression?

The last-in,first-out (LIFO)property is found in the ADT ______.

A program can use the operations of the ADT stack without knowing how the operations are implemented.

Calls to methods that throw StackException must be enclosed in try blocks.

What is an exhaustive search?

In a reference-based implementation of a stack,it is necessary to call the isFull method before calling the push method.

In a reference-based implementation of a stack,the stack can grow and shrink dynamically.

When does the push operation throw a StackException?

A client can access all the elements of a stack.

What is the corrected input if the following line is typed on a keyboard: yww←dshr←←wd←e (where ← represents the backspace character)?

In the StackInterface class,the push method accepts as its parameter an item that is an instance of ______.

An algorithm that uses a stack to implement a nonrecursive solution to the HPAir problem reaches the conclusion that there is no path from an origin city to a destination city only after ______.

A stack has a first in,first out property.

What is meant by the last-in,first-out (LIFO)property?

The ______ method of the ADT stack retrieves and then removes the top of the stack.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 7: Stacks

What is the restriction that the array-based implementation of a stack places on the push operation?

When infix expressions are converted to postfix expressions,the operands always stay in the same order with respect to one another.

The ______ method of the ADT stack retrieves the top of the stack,but does not change the stack.

Which of the following strings contains balanced braces?

Suppose an infix expression contains parentheses as grouping symbols.Is it still possible to convert this expression into postfix notation?

What are the factors which determine the placement of operators when an infix expression is converted to a postfix expression?

The last-in,first-out (LIFO)property is found in the ADT ______.

A program can use the operations of the ADT stack without knowing how the operations are implemented.

Calls to methods that throw StackException must be enclosed in try blocks.

What is an exhaustive search?

In a reference-based implementation of a stack,it is necessary to call the isFull method before calling the push method.

In a reference-based implementation of a stack,the stack can grow and shrink dynamically.

When does the push operation throw a StackException?

A client can access all the elements of a stack.

What is the corrected input if the following line is typed on a keyboard: yww←dshr←←wd←e (where ← represents the backspace character)?

In the StackInterface class,the push method accepts as its parameter an item that is an instance of ______.

An algorithm that uses a stack to implement a nonrecursive solution to the HPAir problem reaches the conclusion that there is no path from an origin city to a destination city only after ______.

A stack has a first in,first out property.

What is meant by the last-in,first-out (LIFO)property?

The ______ method of the ADT stack retrieves and then removes the top of the stack.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters