Let $C$ be an $[n, k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If $\frac{1}{q}\binom{n}{k} \to 0$, then $P(C\text{ is MDS}) \to 1$. We demonstrate that this growth rate is in fact a threshold by proving: If $\frac{1}{q}\binom{n}{k} \to \infty$, then $P(C\text{ is MDS}) \to 0$. A matrix is (\textit{contiguous}) \textit{super-regular} if all of its (contiguous) square submatrices are nonsingular. The above results imply that for any $k \times k$ matrix $A$ chosen uniformly at random over $\mathbb{F}_q$, the following hold: If $\frac{4^k/\sqrt{k}}{q} \to 0$, then $P(A \text{ is super-regular}) \to 1$. If $\frac{4^k/\sqrt{k}}{q} \to \infty$, then $P(A \text{ is super-regular}) \to 0$. We also obtain the following asymptotic probabilities for two variations of the above questions: If $\frac{1}{q}\binom{n}{k} \to \lambda \in (0,\infty)$ and $k/n \to 0$, then $P(C\text{ is MDS}) \to e^{-\lambda}$. If $\frac{k^3/3}{q} \to \lambda \in (0,\infty)$, then $P(A \text{ is contiguous super-regular}) \to e^{-\lambda}$. The number of contiguous super-regular $3 \times 3$ matrices is also a polynomial. Finally, for $4 \times 4$ matrices, we show that the number of super-regular matrices is not a polynomial, nor even a quasi-polynomial of period less than 7, whereas our experimental evidence suggests that the number of contiguous super-regular matrices is a polynomial.