Mesh topology: full, partial and the cable count
Computer Studies · Grade 10 · about 40 minutes
Every extra path buys reliability. A full mesh of n devices needs n(n-1)/2 links; partial mesh keeps extra paths only where an outage is expensive.
Sign in to read this lesson
Lessons are for learners and teachers with an account. Browsing the curriculum — subjects, strands and what each sub-strand covers — stays open to everyone.
- 7 sections of explanation, worked examples and diagrams
- 1 practice task with hints and worked answers
- A quiz that marks itself as you go
- Your progress kept across every subject you take
Other lessons in this sub-strand
- Network topologies: physical and logical
- Choosing a topology, and building one
- Bus topology: backbone, terminators and collisions
- Star topology: hubs, switches and a single point of failure
- Ring topology and token passing
- Mesh topology: full, partial and the cable count
- Tree and hybrid topologies on a school site
- Topology, performance and a working simulation