Maximum number of address bits required to uniquely address 2000 primary memory locations is given by:

To address $N$ distinct memory locations, the required number of address bits $k$ satisfies $2^k \ge N$, meaning $k = \lceil \log_2(N) \rceil$. For $N = 2000$, $\lceil \log_2(2000) \rceil = 11$ bits ($2^{10} = 1024 < 2000 \le 2^{11} = 2048$).

Option Analysis: