Exam 18: Stacks and Queues

What is the output of the following code?

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

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

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

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.

A stack is a(n) ____ data structure.

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

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

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

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

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.

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

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

In ____________________ notation, operators are written after the operands.

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

A queue is a First In First Out data structure.

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

Popping an element from an empty stack is called ____.

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

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