Software Engineering
Numerical Problems
Example1: Suppose a project was estimated to be 400 KLOC. Calculate the
effort and development time for each of the three model i.e., organic, semi-
detached & embedded.
Ans:
The basic COCOMO equation takes the form:
Effort=a1*(KLOC) a2 PM
Tdev=b1*(efforts)b2 Months
Estimated Size of project= 400 KLOC
(i)Organic Mode
E = 2.4 * (400)1.05 = 1295.31 PM
D = 2.5 * (1295.31)0.38=38.07 PM
(ii)Semidetached Mode
E = 3.0 * (400)1.12=2462.79 PM
D = 2.5 * (2462.79)0.35=38.45 PM
(iii) Embedded Mode
E = 3.6 * (400)1.20 = 4772.81 PM
D = 2.5 * (4772.8)0.32 = 38 PM
Example2:
A project size of 200 KLOC is to be developed. Software development team has
average experience on similar type of projects. The project schedule is not very
tight. Calculate the Effort, development time, average staff size, and productivity
of the project.
Answer: The semidetached mode is the most appropriate mode, keeping in view
the size, schedule and experience of development time.
Hence
E=3.0(200)1.12=1133.12PM
D=2.5(1133.12)0.35=29.3PM
Average Staff size = E/D Persons
= 1133.12 / 29.3 Persons
= 38.67 Persons
Productivity = KLOC/E
= 200/1133.12 KLOC/PM
=0.1765 KLOC/PM
Example 3:
Calculate activity expected time and variance for given problem.
Activity ID Optimistic Most Likely Pessimistic
Time (to) Time (tm) Time (tp)
Job1 1 3 5
Job 2 2 6 9
Job 3 2 3 5
Job 4 5 8 10
Job 5 11 15 20
Job 6 2 5 8
Job 7 3 3 3
Job 8 2 4 6
Answer:
Expected Duration = mean = (to + 4tm + tp) / 6
Variance v = [ (tp – to )/6]^2
Standard Deviation = Square root of variance
Activity ID Optimistic Most Pessimistic Expected Variance
Likely Variance
Time (to) Time (tm) Time (tp)
Job1 1 3 5 3 0.44
Job 2 2 6 9 5.8 1.36
Job 3 2 3 5 3.1 0.25
Job 4 5 8 10 7.8 0.69
Job 5 11 15 20 15.16 2.26
Job 6 2 5 8 5 1
Job 7 3 3 3 3 0
Job 8 2 4 6 4 0.44
Example: Compute the function point, productivity, documentation, cost per
function for the following data:
1. Number of user inputs = 24
2. Number of user outputs = 46
3. Number of inquiries = 8
4. Number of files = 4
5. Number of external interfaces = 2
6. Effort = 36.9 p-m
7. Technical documents = 265 pages
8. User documents = 122 pages
9. Cost = $7744/ month
Various processing complexity factors are: 4, 1, 0, 3, 3, 5, 4, 4, 3, 3, 2, 2, 4, 5.
Solution:
Measurement Parameter Count Weighing
factor
1. Number of external inputs (EI) 24 * 4 = 96
2. Number of external outputs (EO) 46 * 4 = 184
3. Number of external inquiries (EQ) 8 * 6 = 48
4. Number of internal files (ILF) 4 * 10 = 40
5. Number of external interfaces (EIF) Count- 2 * 5 = 10
total → 378
So sum of all fi (i ← 1 to 14) = 4 + 1 + 0 + 3 + 5 + 4 + 4 + 3 + 3 + 2 + 2 + 4 + 5
= 43
FP = Count-total * [0.65 + 0.01 *∑(fi)]
= 378 * [0.65 + 0.01 * 43]
= 378 * [0.65 + 0.43]
= 378 * 1.08 = 408
Total pages of documentation = technical document + user document
= 265 + 122 = 387pages
Documentation = Pages of documentation/FP
= 387/408 = 0.94
Example:
The following details are available regarding a project:
Determine the critical path, the critical activities and the project completion
time.
Solution
First let us construct the network diagram for the given project. We mark the
time estimates along the arrows representing the activities. We obtain the
following diagram:
Consider the paths, beginning with the start node and stopping with the end
node. There are two such paths for the given project. They are as follows:
Compare the times for the two paths. Maximum of {22,19} = 22. We see that
path I has the maximum time of 22 weeks. Therefore, path I is the critical path.
The critical activities are A, B, D and F. The project completion time is 22
weeks.
We notice that C and E are non- critical activities.
Time for path I - Time for path II = 22- 19 = 3 weeks.
Therefore, together the non- critical activities can be delayed upto a maximum
of 3 weeks, without delaying the completion of the whole project.
Example:
Draw the network diagram and determine the critical path for the following
project:
Solution
We assert that there are 4 paths, beginning with the start node of 1 and
terminating at the end node of 9. They are as follows:
Compare the times for the four paths. Maximum of {16, 22, 16, 13} = 22. We
see that the following path has the maximum time and so it is the critical path:
The critical activities are B, E, I and K. The non-critical activities are A, C, D,
F, G, H and J. The project completion time is 22 weeks.
