Chapter 18

Question 1

True or false:
The bottom element of the stack is the last element added to the stack.

Answer 1

False

Question 2

True or false:
In the array representation of a stack, if a value called stackTop indicates the number of elements in the stack,
then stackTop-1 points to the top item of the stack.

Answer 2

True

Question 3

True or false:
If you try to add a new item to a full stack, the resulting condition is called an outflow.

Answer 3

False

Question 4

True or false:
In the linked implementation of stacks, the memory to store the stack elements is allocated statically.

Answer 4

False

Question 5

True or false:
The default constructor for the linked implementation of a stack initializes the stack to an empty state when a stack
object is declared.

Answer 5

True

Question 6

True or false:
Postfix notation requires the use of parentheses to enforce operator precedence.

Answer 6

False

Question 7

True or false:
The infix expression
(a + b) * (c - d / e) + f
is equivalent to the postfix expression
ab + cde /-* f +

Answer 7

True

Question 8

True or false:
The expression a + b is the same in both infix notation and postfix notation.

Answer 8

False

Question 9

True or false:
A queue is a First In First Out(FIFO) data structure.

Answer 9

True

Question 10

A(n) ____ is a list of homogenous elements in which the addition and deletion of elements occurs only at one end.

Answer 10

stack

Question 11

The addition and deletion of elements of a stack occurs only at the ____ of the stack.

Answer 11

Top

Question 12

The ____ element of the stack is the last element added to the stack.

Answer 12

top

Question 13

A stack is a(n) ____ data structure.

Answer 13

LIFO(Last In First Out)

Question 14

You can perform the add operation, called ____, to add an element onto the stack.

Answer 14

push

Question 15

You can perform the operation ____ to remove the top element from the stack.

Answer 15

pop

Question 16

A stack can be implemented as either a(n) ____ or a linked structure.

Answer 16

array

Question 17

When a stack is implemented as an array, the array is empty if the value of stackTop is ____.

Answer 17

zero

Question 18

If you try to add a new item to a full stack, the resulting condition is called a(n) ____.

Answer 18

overflow

Question 19

Popping an element from an empty stack is called ____.

Answer 19

underflow

Question 20

What is the output of the following code?

stackType<int> stack;
int x, y;
x = 5;
y = 3;
stack.push(4);
stack.push(x);
stack.push(x + 1);
y = stack.top();
stack.pop();
stack.push(x + y);
x = stack.top();
stack.pop();
cout << "x = " << x << endl;
cout << "y = " << y << endl;</int>

Answer 20

x = 11
y = 6

Question 21

The following expression (a - b) * (c + d) is equivalent to which of the following postfix expressions?

Answer 21

a b - c d + *

Question 22

The postfix expression 5 6 + 4 * 10 5 / - = evaluates to ____.

Answer 22

42

Question 23

The postfix expression 2 4 6 * + 15 - 21 7 / + = evaluates to ____.

Answer 23

14

Question 24

In evaluating a postfix expression, when an equal sign (=) is encountered, how many elements must the stack contain
so that no error is generated?

Answer 24

one

Question 25

The postfix expression 3 5 + 2 ; 6 - = will generate an error, because it ____.

Answer 25

contains an illegal operator

Question 26

The postfix expression 14 2 5 + = will generate an error, because ____.

Answer 26

there will be too many elements in the stack when the equal sign is encountered

Question 27

A queue is a data structure in which the elements are ____.

Answer 27

added to the rear and deleted from the front

Question 28

Which of the following is listed in the chapter as a basic operation performed on a queue?

Answer 28

isEmptyQueue

Question 29

What is the output of the following code?

queueType<int> queue;
int x, y;
x = 2;
y = 3;
queue.addQueue(x);
queue.addQueue(y);
x = queue.front();
queue.deleteQueue();
queue.addQueue(x + 2);
queue.addQueue(x);
queue.addQueue(y - 3);
y = queue.front();
queue.deleteQueue();
cout << "x = " << x << endl;
cout << "y = " << y << endl;</int>

Answer 29

x = 2
y = 3

Question 30

What is the output of the following code?

queueType<int> queue;
int x, y;
x = 2;
y = 6;
queue.addQueue(x);
queue.addQueue(y);
x = queue.front();
queue.deleteQueue();
queue.addQueue(x + 2);
queue.addQueue(x);
queue.addQueue(y - 3);
while (!queue.isEmptyQueue())
{
cout << queue.front() << " ";
queue.deleteQueue();
}
cout << endl</int>

Answer 30

6 4 2 3

Question 31

A technique in which one system models the behavior of another system is called ____.

Answer 31

simulation

Question 32

To describe a queuing system, we use the term ____ for the object that provides the service.

Answer 32

server

Question 33

To describe a queuing system, we use the term ____ for the object receiving the service.

Answer 33

customer

Question 34

The elements at the ____________________ of the stack have been in the stack the longest.

Answer 34

bottom

Question 35

An array is a(n) ____________________ access data structure.

Answer 35

random

Question 36

In the array representation of a stack, the stack is initialized simply by setting stackTop to
____________________.

Answer 36

zero(0)

Question 37

The ____________________ constructor is called when a stack object is passed as a (value) parameter to a
function.

Answer 37

copy

Question 38

In ____________________ notation, operators are written after the operands.

Answer 38

postfix

Question 39

____________________ techniques are used when it is too expensive or dangerous to experiment with real
systems.

Answer 39

simulation

Question 40

When describing a queuing system, we use the term ____________________ to refer to the time it takes to serve
a customer.

Answer 40

transaction time

Question 41

In a(n) ____________________ simulation, the clock is implemented as a counter, and the passage of, say, one
minute can be implemented by incrementing the counter by 1.

Answer 41

time-driven

Question 42

In a queuing system, every customer has a customer number, arrival time, ____________________ time,
transaction time, and departure time.

Answer 42

waiting