Exam 18: Stacks and Queues

In a(n) ____________________ array, the first array position immediately follows the last array position.

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

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

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

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

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

In the late 1950s, the Australian philosopher and early computer scientist Charles L. Hamblin proposed a scheme in which the operators follow the operands (postfix operators), resulting in ____________________ notation.

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

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

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

Popping an element from an empty stack is called ____.

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

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

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(n) ____ is a list of homogenous elements in which the addition and deletion of elements occurs only at one end.

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

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

What is the output of the following code? stackType<int> stack; int x, y; x = 4; y = 2; stack.push(6); 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;

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

If the queue is empty, the operation ____________________ terminates the program.