Which statement about a static data structure is accurate?

Which statement about a static data structure is accurate?

• A. It has a fixed size determined at allocation.
• B. It can grow automatically when elements are added.
• C. It stores data in a linked list internally.
• D. It changes size based on the number of operations.

Answer: (A)

Static data structures have a fixed size determined at allocation, and that size stays the same for their entire lifetime. You can store only up to that many elements; if you need more space, you must allocate a new, larger structure. They don't grow automatically when elements are added, which is why they’re considered fixed in capacity. The internal storage isn’t required to be a linked list; a common example is a fixed-length array, though implementations can vary. Because the size isn’t adjusted during use, it does not change with the number of operations.

Static data structures have a fixed size determined at allocation, and that size stays the same for their entire lifetime. You can store only up to that many elements; if you need more space, you must allocate a new, larger structure. They don't grow automatically when elements are added, which is why they’re considered fixed in capacity. The internal storage isn’t required to be a linked list; a common example is a fixed-length array, though implementations can vary. Because the size isn’t adjusted during use, it does not change with the number of operations.