In programming, an array is defined as:

In programming, an array is defined as:

• A. A variable-length collection of values that can be of different types.
• B. A fixed amount of values for a single variable.
• C. A data structure that maps keys to values.
• D. A sequence of elements that automatically resizes without reallocation.

Answer: (B)

The key idea being tested is that an array reserves a fixed number of slots when it is created. An array defines a set amount of storage for a single variable, so you allocate a specific size up front and that size doesn’t change as you use the array. This makes arrays efficient for indexed access because each element has a known, constant position in memory. That’s why the description “a fixed amount of values for a single variable” fits best. It contrasts with other concepts: a collection that can grow or hold different types isn’t a classical fixed-size array; a map or dictionary stores values by keys rather than by numerical indices; and a structure that resizes without reallocation isn’t how typical arrays behave—resizing generally involves allocating more memory or copying elements, not keeping the original allocation intact.

The key idea being tested is that an array reserves a fixed number of slots when it is created. An array defines a set amount of storage for a single variable, so you allocate a specific size up front and that size doesn’t change as you use the array. This makes arrays efficient for indexed access because each element has a known, constant position in memory.

That’s why the description “a fixed amount of values for a single variable” fits best. It contrasts with other concepts: a collection that can grow or hold different types isn’t a classical fixed-size array; a map or dictionary stores values by keys rather than by numerical indices; and a structure that resizes without reallocation isn’t how typical arrays behave—resizing generally involves allocating more memory or copying elements, not keeping the original allocation intact.