What is a primary memory-related advantage of using a singly linked list over an array?

• A. Nodes are allocated separately and non-contiguously, which reduces the need for large contiguous blocks.
• B. It guarantees constant time random access to any element.
• C. It stores elements in a single contiguous block.
• D. It cannot be grown by adding new nodes.

Answer: (A)

The main idea here is that a singly linked list can store its nodes in non-contiguous memory blocks. Each node is allocated separately, so you don’t need one big, contiguous chunk of memory to hold all elements. This is a real advantage when memory is fragmented or when the list grows, because you can place new nodes wherever space is available and link them together.

The other statements don’t fit: you don’t get constant-time random access in a linked list—you must traverse from the head to reach a given position. That makes access slower than in an array. A linked list doesn’t store elements in a single contiguous block; that characteristic is what arrays do. And linked lists can grow by adding new nodes, so the claim that they cannot be grown is false.