Exam 7: Stacks

The computer uses a stack to implement function calls.

A data structure in which the elements are added and removed from one end only is known as a ____.

Adding, or pushing, an element onto the stack is a two-step process.

The postfix expression 2 3 + 1 * = evaluates to 8.

Because all the elements of a stack are of the same type, you can use a(n) ____ to implement a stack.

The function discardExp reads and writes the input data only until the input is '____'.

The class linkedListType is a(n) ____ class and therefore does not implement all the operations.

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 the ____ notation.

The equivalent postfix expression for the infix expression a + b is + a b.

You can use stacks to convert recursive algorithms into nonrecursive algorithms, especially recursive algorithms that are not tail recursive.

If the postfix expression contains no errors, the function ____ prints the result.

To successfully implement a stack, we need at least seven operations.

The stack container class provides the operation size to return the actual number of elements in the stack.

The stack is empty if stackTop is ____.

In ____ notation, the operator is written between the operands.

The operation ____ is used to remove the top element from the stack.

The time-complexity of the copyStack function is O(1).

We can perform the operation ____ to retrieve the top element of the stack.

To remove, or pop, an element from the stack ____.

The item added to the stack last will be the item removed last.