algo

During a POP operation in a STATIC STACK,  the elements are being moved one step up. 

• True

• False

The following are stack operations except

• IsEmpty

• Pop

• Clear

• Push

What happens to the value of the TOP during a PUSH operation in a STATIC STACK?

• decrements by 1

• becomes -1

• increments by 1

• becomes 0

In a DYNAMIC STACK, the node that was POPPED is deleted.

• True

• False

The following are 3 possible containers that can be used in implementing the STL Stack, except:

• deque

• list

• array

• vector

The initial value of index top in the static implementation of  a stack is 0

• True

• False

Using pop function automatically moves the top pointer to the next node without deleting the memory used.

• True

• False

The STL function top returns a reference to the element at the top of the stack.

• True

• False

Below is a valid declaration of a dynamic stack implemented as a list:

stack< int, list<int> > iStack;

• True

• False

Below is a valid declaration of a dynamic stack implemented as a vector:

stack< int > iStack

• True

• False