Exam 17: Stacks and Queue

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

What is the output of the following code?

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

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

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

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

Postfix notation requires the use of parentheses to enforce operator precedence.

Popping an element from an empty stack is called ____.

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.

What is the output of the following code?

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

What is the output of the following code?

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

A stack is a(n) ____ data structure.

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

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

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

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

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