Exam 7: Stacks

The operation ____ reinitializes the stack to an empty state.

If we compare the push function of the stack with the insertFirst function for general lists, we see that the algorithms to implement these operations are similar.

In a linked list implementation of a stack, only a fixed number of elements can be pushed onto the stack.

An element can be removed from the stack only if there is something in the stack, and an element can be added to the stack only if there is room.

The function ____, if possible, evaluates the expression and leaves the result in the stack.

The operation pop returns the top element of the stack.

If the postfix expression is error free, the function ____ outputs the result.

The ____ operation checks whether the stack is empty.

The operation top removes the top element of the stack.

The function copyStack makes a copy of a stack.

A stack is a list of homogenous elements in which the addition and deletion of elements occurs only at one end.

The function ____ is called whenever an error is discovered in the expression.

The function evaluateExpression evaluates each ____ expression.

The postfix expression 6 3 + 2 * = evaluates to 18.

Stacks can be used to print a list backwards without using recursion.

The ____ can be used to determine whether two stacks are identical.

A client's program can include a header file via the ____ statement.

The function ____ makes an identical copy of a stack.

The ____ operation checks whether the stack is full.

The operation push removes the bottom element from the stack.