Which statement correctly matches a static and a dynamic data structure?

Which statement correctly matches a static and a dynamic data structure?

• A. Static: Array; Dynamic: List.
• B. Static: Linked List; Dynamic: Array.
• C. Static: List; Dynamic: Array.
• D. Static: Dictionary; Dynamic: Hash Table.

Answer: (A)

Understanding fixed-size versus growable data structures helps explain why this match is correct. An array is typically created with a specific size and doesn’t automatically resize as you add elements; if you run out of space you have to create a new, larger array and copy the data over. That fixed-size behavior makes arrays a static structure. A List, on the other hand, is designed to change its size as you add or remove elements. It can grow (and sometimes shrink) at runtime, often by using a dynamic backing store or a linked layout. That growable nature is what makes it dynamic. So pairing static with array and dynamic with list best reflects how these structures behave. The other options mix fixed-size and growable concepts with structures that aren’t typically categorized that way (for example, linked lists are dynamic, and many dictionary/hash table implementations grow as needed).

Understanding fixed-size versus growable data structures helps explain why this match is correct. An array is typically created with a specific size and doesn’t automatically resize as you add elements; if you run out of space you have to create a new, larger array and copy the data over. That fixed-size behavior makes arrays a static structure.

A List, on the other hand, is designed to change its size as you add or remove elements. It can grow (and sometimes shrink) at runtime, often by using a dynamic backing store or a linked layout. That growable nature is what makes it dynamic.

So pairing static with array and dynamic with list best reflects how these structures behave. The other options mix fixed-size and growable concepts with structures that aren’t typically categorized that way (for example, linked lists are dynamic, and many dictionary/hash table implementations grow as needed).