Difficulty: Easy
Correct Answer: 5
Explanation:
Introduction / Context:
Subnet-count planning uses powers of two. The number of subnet bits you borrow from the host field must be large enough so that 2^(borrowed_bits) meets or exceeds the number of required subnets.
Given Data / Assumptions:
Concept / Approach:
Find the smallest n such that 2^n ≥ 29. The fewer bits we borrow, the more host bits remain, maximizing host capacity.
Step-by-Step Solution:
Verification / Alternative check:
Check next lower value (4) fails; next higher (6) would reduce host space unnecessarily.
Why Other Options Are Wrong:
Common Pitfalls:
Forgetting that modern designs allow using all subnets (subnet-zero included); borrowing more bits than needed and needlessly shrinking host capacity.
Final Answer:
5
Discussion & Comments