To try all possible passwords of length k or less would require ____ attempts. A)n^k B)k^k C)n ¹ + n ² + … + n ^k D)k¹ + k² + … + kⁿ

Question

Quizplus · Accepted Answer

The correct choice is C because it represents the sum of all possible passwords of lengths 1 through k, assuming there are n possible characters for each position in the password. This is calculated by adding the number of combinations for each length, which is $n^1 + n^2 + \ldots + n^k$, accurately reflecting the total attempts needed to try all possible passwords of length k or less.

To Try All Possible Passwords of Length K or Less