First in first out
Last in first out
Random access
Push, pop, and peek
InsertAt, removeAt, peekAt
None of the above
Before the stack is used, and never after
Before the stack is used, and any time the stack is empty
Any time
True
False
True
False
Stacks can only be implemented with a generic class
Stacks are implemented using either an array or a linked list
Stacks can only be implemented using the operating system resources for a stack
The null reference is returned
The StackUnderflowException is thrown
None of the above
Initialize the stack size; set the stack to empty; create the array
Nothing since the push operation will initialize the array if needed
Create a default node for the head of the stack
Deletes the first item in the stack to make room for the new item
Throws the StackOverflowException
None of the above
There are no benefits, just coded differently
The linked list stack must use generic classes to work
The linked list stack does not have a fixed size
Both uses point to the head node
The array uses it as an index and the linked list uses it as a node pointer
None of the above
Homogeneous data
Heterogeneous data
A very limited set of data types such as integers, strings
In the pop() method
In the isEmptyStack() method
In the isFullStack() method
A full stack
An empty stack
None of the above
The peek() method
The push() method
The pop() method