Calculating Connectivity Patterns in a Computer Network

Click For Summary

Homework Help Overview

The problem involves calculating the number of network cables needed to connect five computers in a point-to-point configuration and determining the possible connectivity patterns based on the state of these cables (either "alive" or "dead").

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to calculate the number of cables using combinations and expresses confusion regarding the second part of the problem, considering different combinations of live cables. Other participants suggest alternative methods, including a binary representation approach to count states.

Discussion Status

Participants are exploring various methods to approach the problem, with some suggesting a binary representation for counting states. There is acknowledgment of the number of cables needed, but some participants are clarifying the correct interpretation of the problem.

Contextual Notes

There is a mention of the original poster's confusion regarding the calculations for the second part of the problem, as well as a potential misunderstanding about the number of cables involved.

blackle
Messages
8
Reaction score
0

Homework Statement


[A computer network consisting of five computers is to be formed by connecting each computer to each of the others by a direct ("point-to-point") network cable.

a) How many network cables are needed?

b) Unfortunately, some of the cables may be faulty ("dead") while others are OK ("alive"). How many different "connectivity patterns" are possible? (E.g., "the cable between computers 1 & 3 is alive, but no others are" is one pattern; "1 & 4, but no others" is a different pattern; "only cable {1, 4} is dead" is a third pattern, etc.)



So I know a) should be 5C2 = 10. But, I am very confused with part b)
I am thinking that to do b) we could think of it as a sum of the number of combinations with increasing number of live cables. For instance if we take 3 computers, then the total no. of combinations possible are (#of ways with 0 live cables) + (# of ways with 1 live cable) + (#no. of ways with 2 live cable) + (# of ways with 3 live cable) = which gives 8.

I could do it for 3 because I manually drew it out, but I am unable to think of equations to come up with these values.
#of ways with 0 live cables = always equal to 1
#of ways with 1 live cable = 5C2 (when there are 5 computers)
#of 1 with with 2 live cables = ?

Am I using the right approach to solve this problem?
 
Physics news on Phys.org
Do the three cable case a different way. You have two choices for the state of cable 1, two for the state of cable 2 and two for the state of cable 3. How many total? Answer quickly without splitting into cases on how many are live.
 
Last edited:
Right! Thank you. Reminds of of binary representation. 5 computers, each two possible states 0 or 1. So 2^5 is all the possible number of states. Now to doing the rest of the parts of the problem. Thanks again :)
 
blackle said:
Right! Thank you. Reminds of of binary representation. 5 computers, each two possible states 0 or 1. So 2^5 is all the possible number of states. Now to doing the rest of the parts of the problem. Thanks again :)

Ok, but the number of cables is 10, not 5, right?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 19 ·
Replies
19
Views
2K
Replies
9
Views
5K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K