Compare the dynamic resizing behavior of arrays vs linked lists.

• A. Arrays may need resizing or copying when full; linked lists grow by adding new nodes with no relocation.
• B. Arrays never need copying; linked lists require array reallocation.
• C. Both have identical resizing costs.
• D. Linked lists require contiguous memory.

Answer: (A)

When thinking about how these structures handle more data, the key idea is that arrays have a fixed capacity while linked lists grow by adding new nodes without moving existing data. An array uses a single, contiguous block of memory. When it becomes full, you must allocate a larger block and copy every existing element into it, which is the costly resizing or copying step. This is why dynamic arrays, even though they resize, pay an occasional expensive cost when expansion happens, but they often do it by doubling capacity to keep the average insertion cost low.

Linked lists, on the other hand, add new elements by creating a new node and linking it into the list. There’s no need to relocate or copy the existing nodes, so resizing doesn’t involve moving data. Each node is allocated separately, and memory doesn’t have to be contiguous, which is another big difference from arrays.

So the best description is that arrays may need resizing or copying when full, whereas linked lists grow by adding new nodes with no relocation. The other statements don’t fit: arrays can require copying, they don’t always avoid copying; resizing costs aren’t identical between the structures; and linked lists do not require contiguous memory.