A dynamic data structure
A) almost always is implemented using lists of one sort or another
B) is just a collection
C) almost always is implemented using references (pointers) to objects
D) can have a fixed size
E) none of the above

Question

Quizplus · Accepted Answer

C) A dynamic data structure is one that can grow and shrink during execution. In order to implement such a data structure in Java, one must use references (pointers) to objects. Java collections are but one set of examples of dynamic data structuresprovided by the Java libraries.

A Dynamic Data Structure