سوال ۳۰ کنکور ارشد علوم کامپیوتر ۱۴۰۰

Read the relevant excerpt and answer the question.

PASSAGE 3: Structure, Sparsity, and Black Boxes

Most large matrices of computational interest are simpler than their vast numbers of individual entries might suggest. They have some kind of structure, and as the years have gone by, ways have been found to exploit this structure in more and more contexts.

The most obvious structure that a large matrix may have is sparsity, i.e., preponderance of zero entries. (The opposite of sparse is dense.) For example, a finite-difference discretization of a partial differential equation may lead to a matrix of dimension $m = 10^{5}$ with only $\nu = 10$ nonzero entries per row.

Question: Choose and mark the choice having closest meaning to the underlined word "preponderance" in the second paragraph ----------.