What data structure stores a fixed-size sequence of elements of the same type?

What data structure stores a fixed-size sequence of elements of the same type?

• A. Array
• B. Linked List
• C. Stack
• D. Queue

Answer: (A)

An array is a data structure that stores a fixed-size sequence of elements of the same type. It allocates a contiguous block of memory for a specified number of items, so every slot is reserved in advance. Because all elements share the same type and are laid out contiguously, you can access any position directly with its index in constant time, which makes lookups fast. The fixed-size aspect means the capacity is set when the array is created and doesn’t change automatically, unlike structures that can grow or shrink. A linked list arranges elements in separate nodes connected by pointers, so the total number of elements can vary and memory isn’t necessarily contiguous. A stack stores items with a last-in, first-out access pattern, and a queue uses first-in, first-out order; both describe how elements are used, and they can be implemented using arrays or linked lists, but they aren’t defined by storing a fixed-size sequence of identical elements in a single contiguous block. Therefore, the data structure that matches a fixed-size sequence of elements of the same type is the array.

An array is a data structure that stores a fixed-size sequence of elements of the same type. It allocates a contiguous block of memory for a specified number of items, so every slot is reserved in advance. Because all elements share the same type and are laid out contiguously, you can access any position directly with its index in constant time, which makes lookups fast. The fixed-size aspect means the capacity is set when the array is created and doesn’t change automatically, unlike structures that can grow or shrink.

A linked list arranges elements in separate nodes connected by pointers, so the total number of elements can vary and memory isn’t necessarily contiguous. A stack stores items with a last-in, first-out access pattern, and a queue uses first-in, first-out order; both describe how elements are used, and they can be implemented using arrays or linked lists, but they aren’t defined by storing a fixed-size sequence of identical elements in a single contiguous block. Therefore, the data structure that matches a fixed-size sequence of elements of the same type is the array.