Register

NIELIT 2016 MAR Scientist B - Section C: 46

• retagged by
1,209 views

1 Answer

1 votes
1 votes

 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$

 

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.5k
views
1 answers
0 votes
admin asked Mar 31, 2020
1,506 views
NIELIT 2016 MAR Scientist B - Section C: 47
In object oriented design of software, objects haveattributes and name onlyoperations and name onlyattributes name and operationsmutation and permutation property
User Avatar
904
views
1 answers
0 votes
admin asked Mar 31, 2020
904 views
NIELIT 2016 MAR Scientist B - Section C: 49
The extent to which the software can control to operate correctly despite the introduction of invalid input is called asreliabilityrobustnessfault toleranceportability
User Avatar
2.0k
views
1 answers
0 votes
admin asked Mar 31, 2020
2,000 views
NIELIT 2016 MAR Scientist B - Section C: 50
On an average, the programmer months is given by $3.6 \times (KLOC)​\large^{1.2​}$. If so, a project requiring one thousand source instructions will require$3.6$ PM.$0.36$ PM.$0.0036$ PM.$7.23$ PM
User Avatar
1.2k
views
1 answers
0 votes
admin asked Mar 31, 2020
1,234 views
NIELIT 2016 MAR Scientist B - Section C: 51
Relation of COCOMO model is$E=a*(KLOC)^6$E=a*(KLOC)^5$E=a*(KLOC)^7$E=a*(KLOC)^3$
User Avatar
Link Copied!