Difficulty: Easy
Correct Answer: 16
Explanation:
Introduction / Context:Address lines determine how many distinct locations a memory can select. The count follows a power-of-two relationship: with N address lines, you can uniquely address 2^N locations. This question applies the formula to a common capacity figure.
Given Data / Assumptions:
Concept / Approach:Use the identity 2^N = number of unique addresses. Solve for N such that 2^N ≥ 65,536. Because 2^16 = 65,536 exactly, N = 16 address lines are required.
Step-by-Step Solution:
Recall powers of two: 2^10 = 1,024; 2^16 = 65,536.Match target: 64K = 65,536 = 2^16.Therefore N = 16 address lines.Verification / Alternative check:Compute log2(65,536) = 16 exactly. Any fewer lines would address fewer than 65,536 locations.
Why Other Options Are Wrong:
10/12/14: 2^10, 2^12, 2^14 are far below 65,536.18: Would over-provision to 262,144 addresses.Common Pitfalls:Confusing 64K bytes with 64K words and mixing address lines with data bus width; the address lines depend on number of locations, not data word size.
Final Answer:16
Discussion & Comments