A fully connected mesh of n nodes requires how many wires?
An(n-1)/2
Bn(n-1)/3
Cn(n-2)/2
Dn(n+1)/3
Answer & Solution
Correct answer: A. n(n-1)/2
1. Every node must reach every other node exactly once.
2. Counting pairs of nodes gives the wire count.
3. A fully connected mesh topology of n nodes requires n(n-1)/2 wires.
4. So the answer is n(n-1)/2.
_Source: syllabus Computer Science, Ch 10 'Computer Networks'_
Keep practising Computer Networks
Browse all Computer Networks questions for BCA, or explore more Computer Science topics.