Exam 17: Stacks and Queue

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

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

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

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

A queue is a First In First Out data structure.

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

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

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

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 following expression (a - b) * (c + d) is equivalent to which of the following postfix expressions?

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

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

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

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

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

What is the output of the following code? ​ ​

The expression a + b is the same in both infix notation and postfix notation.

In ____________________ notation, operators are written after the operands.

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.