NIELIT 2016 MAR Scientist B - Section C: 46

Question

According to Brooks, if $n$ is the number of programmers in a project team, then the number of communication path is

• A. $n(n-1)/2$
• B. $n\log n$
• C. $n$
• D. $n(n+1)/2$

Answer 1

 if n is the number of programmers in a project team, then the number of communication path is

you can see this statement as

same as a compete graph where n number of node ,then the number of edge possible 

= $n(n-1)/2$