Let's understand the question which asks us to identify the types of 2-dimensional arrays (matrices) based on the proportion of zero entries they contain.

Understanding Matrices and Zero Entries

A 2-dimensional array, also known as a matrix, is a collection of numbers arranged in rows and columns. The elements within the matrix can be any number, including zero.

The question focuses on the frequency of zero values compared to non-zero values within the matrix.

Identifying Sparse Matrices

When a matrix has a relatively high proportion of zero entries compared to non-zero entries, it is called a Sparse Matrix. There isn't a strict threshold, but generally, if a large percentage of the elements are zero, it's considered sparse. Sparse matrices are common in various applications like graph theory, machine learning, and scientific simulations.

Identifying Dense Matrices

Conversely, when a matrix has a relatively low proportion of zero entries (meaning most entries are non-zero), it is called a Dense Matrix. These matrices have a higher density of non-zero elements throughout their structure.

Analyzing the Options

Let's look at the given options:

• Option 1: Regular Matrix; Non-Regular Matrix - These terms are not standard classifications for matrices based on the proportion of zero entries.
• Option 2: Square Matrix; Dense Matrix - A Square Matrix is one where the number of rows equals the number of columns ($\text{rows} = \text{columns}$). This property is unrelated to the number of zero entries. Dense Matrix correctly describes matrices with a low proportion of zeros, but "Square Matrix" doesn't fit the first part of the description (high proportion of zeros).
• Option 3: Transpose Matrix; Inverse Matrix - Transpose and Inverse are operations that can be performed on matrices. They describe a relationship between two matrices (original and its transpose or inverse), not a classification based on zero entry proportion.
• Option 4: Sparse Matrix; Dense Matrix - A Sparse Matrix has a high proportion of zero entries, and a Dense Matrix has a low proportion of zero entries. This perfectly matches the description given in the question.

Therefore, a 2-Dimensional array (Matrix) with a relatively high proportion of zero entries is called a Sparse Matrix, while one with a low proportion of zero entries is called a Dense Matrix.

Comparison of Sparse and Dense Matrices

Conclusion

Based on the definitions and the analysis of options, the correct terms for matrices with a high and low proportion of zero entries are Sparse Matrix and Dense Matrix, respectively.

Revision Table: Matrix Types and Zeros

Understanding matrix types based on their content is crucial in linear algebra and data structures. Key terms are:

• Sparse Matrix: Many zeros, few non-zeros.
• Dense Matrix: Few zeros, many non-zeros.

Additional Information: Why Sparse Matrices Matter

Sparse matrices are important because they often represent real-world data (like connections in a network, or values in a large system of equations) where most interactions or values are zero. Storing and processing sparse matrices efficiently using specialized data structures can save significant memory and computation time compared to treating them as dense matrices, especially for very large matrices.