Question

What is the difference between one-dimensional and two-dimensional arrays in C++?

• A. One-dimensional arrays store data in a single row, while two-dimensional arrays store data in rows and columns.
• B. One-dimensional arrays can only hold integers, while two-dimensional arrays can hold any data type.
• C. One-dimensional arrays are faster to access, while two-dimensional arrays are more flexible.
• D. One-dimensional arrays are always statically allocated, while two-dimensional arrays can be dynamically allocated.

Hint:

Think of array dimensions like coordinates. A one-dimensional array needs one coordinate (an index) to find an element, like finding a house on a single street. A two-dimensional array needs two coordinates (row and column), like finding a seat in a movie theater.

Answer 1

The Correct Option is A

Step 1: Introduction to Arrays:
Arrays in C++ store elements of the same data type contiguously in memory. The "dimension" indicates how elements are accessed logically.
Step 2: Array Dimensions Explained:
1D arrays are sequences, 2D arrays are tables: This accurately describes the logical structure. A 1D array is accessed with one index, like `arr[i]`. A 2D array uses two indices, e.g., `arr[i][j]`, representing rows and columns. This conceptual difference is correct.
Data Types: Both 1D and 2D arrays can hold any single data type (e.g., `int`, `float`, `char`).
Access Speed and Flexibility: Access time is generally O(1) for both array types. Flexibility isn't inherently different.
Allocation: Both 1D and 2D arrays can be statically or dynamically allocated (using `new`).
Step 3: Key Takeaway:
The core difference lies in their structure: 1D arrays are linear (sequences), while 2D arrays are tabular (rows and columns).