Note: This summary consists out of an application and
theory part.
Application
COCOMO
It is a cost estimation model that was built around an equation. Equation is
Boehm’s equation.
The equation:
Effort = c*(size)^k
Variables in Boehm’s equation:
Effort: measured in person months consisting of 152 working hours (1 mark)
Size: measured in thousands of delivered source code instructions (kdsi) (1
mark)
c and k are constants:
The constants, c and k, depend on whether the system could be classified, in Boehm’s
terms, as “organic”, “semi-detached” or “embedded”
The constants:
Example:
,None of them will be completed in 3 years
CPD network diagram: Activity-on-node
diagram
Example:
,Note: Float is the slack time, i.e. the time there is available to wait.
Thus the critical path will be where all the Float’s os 0. Thus critical path is
A->B->E->G->I->J.
Non critical activities are the one’s which float is not 0. i.e. C, D, F and H.
To calculate duration of critical path just add all durations of activities in the
critical path. Duration = 4+ 2+5+6… = 31
Note critical path duration will be the most (more than other paths).
Activity-on-arrow
,
,
,
,
,
theory part.
Application
COCOMO
It is a cost estimation model that was built around an equation. Equation is
Boehm’s equation.
The equation:
Effort = c*(size)^k
Variables in Boehm’s equation:
Effort: measured in person months consisting of 152 working hours (1 mark)
Size: measured in thousands of delivered source code instructions (kdsi) (1
mark)
c and k are constants:
The constants, c and k, depend on whether the system could be classified, in Boehm’s
terms, as “organic”, “semi-detached” or “embedded”
The constants:
Example:
,None of them will be completed in 3 years
CPD network diagram: Activity-on-node
diagram
Example:
,Note: Float is the slack time, i.e. the time there is available to wait.
Thus the critical path will be where all the Float’s os 0. Thus critical path is
A->B->E->G->I->J.
Non critical activities are the one’s which float is not 0. i.e. C, D, F and H.
To calculate duration of critical path just add all durations of activities in the
critical path. Duration = 4+ 2+5+6… = 31
Note critical path duration will be the most (more than other paths).
Activity-on-arrow
,
,
,
,
,
