Exam 18: Stacks and Queues

The operation ____________________ reinitializes a stack to an empty state.

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

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

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

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

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;

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

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

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

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()) { $\quad$ cout << queue.front() << " "; $\quad$ queue.deleteQueue(); } cout << endl