A data structure that uses object reference variables to create links between
D. Array
What is the principle difference in behavior between a stack and a queue?
C. there is no difference
D. a stack preserves order whereas a queue reverses order
Stacks operate as _______________.
D. None of the above
A ______ can be used to reverse the order of a set of data.
A. Queue
D. pointer
Object reference variables can be used to create ___________.
A. Arrays
D. size
Elements in a collection are typically organized by
A. the order of their addition to the collection
B. by some inherent relationship among the elements
A linked implementation of a stack adds and removes elements from the
_______ of the linked list.
D. None of the above
When all references to an object are lost and the object can no longer be used,
up by the unreferenced object.
were to place elements on a collection and then wanted to reverse the order,
would it be better to use a Stack or a Queue?
long as it validly implements the appropriate operations.
appropriate data.
If an exception occurs during the execution of a java program and is not handled
under a common name.
hidden.
separating the concept of an abstract data type from its implementation.
computers memory.
to another.
a linked list.
True/False. The pop operation is implemented by returning a reference to the
element currently stored at the top of the stack and adjusting the top reference to
the new top of the stack.
in is the first element out.
capacity limitations.
True/False. Implementing a list with a sentinel node or dummy node as the first
node eliminates the special cases dealing with the first node.
details of the underlying data structure.
What is a collection?
What is a data type?
What is an abstract data type?
What is abstraction and what advantage does it provide?
Why is a class an excellent representation of an abstract data type?
What is the characteristic behavior of a stack?
What are the five basic operations on a stack?
The operations are:
What are some of the other operations that might be implemented for a stack?
What is key to remember when handling linked lists?
Explain how a linked list is formed using object reference variables.
How do object references help us define data structures?
Compare and contrast a linked list and an array.
What special case exists when managing linked lists?
Why should a linked list node be separate from the element stored on the list?
What do the LinkedStack<T> and ArrayStack<T> classes have in common?
What would be the time complexity of the push operation if we chose to push
at the end of the list instead of the front?
What is the difference between a doubly linked list and a singly linked list?
What impact would the use of sentinel nodes or dummy nodes have upon a
doubly linked list implementation?
What are the advantages to using a linked implementation as opposed to an
array implementation?
What are the advantages to using an array implementation as opposed to a
linked implementation?
What are the advantages of the java.util.Stack implementation of a stack?
What is the potential problem with the java.util.Stack implementation?