Exam 18: Stacks and Queues

Which of the following is listed in the chapter as a basic operation performed on a 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?

What is the output of the following code?

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

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

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

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

The infix expression

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

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

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

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

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

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

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

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

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

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

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