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 these

Question

Quizplus · Accepted Answer

Dynamic data structures require the ability to allocate and deallocate memory during program execution, which is typically achieved through the use of references or pointers to objects. Lists and collections are examples of dynamic data structures, but they are not requirements. The dynamic aspect of the structure refers to its ability to change size as needed, so a fixed size would not be possible.

A Dynamic Data Structure