0% found this document useful (0 votes)
4 views4 pages

Assignment 2 - Module 2

The document contains a series of software engineering assignment questions focused on calculating software development metrics such as effort, cost, and function points using various models like COCOMO. It includes specific scenarios with estimated lines of code and parameters for different project types. Additionally, it asks for calculations related to Halstead metrics for provided code samples.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views4 pages

Assignment 2 - Module 2

The document contains a series of software engineering assignment questions focused on calculating software development metrics such as effort, cost, and function points using various models like COCOMO. It includes specific scenarios with estimated lines of code and parameters for different project types. Additionally, it asks for calculations related to Halstead metrics for provided code samples.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Amity School Of Engineering and Technology

Subject: Software Engineering


Assignment 2

Module 2

Que 1:Assume estimated lines of code of a system is: 33,600 LOC -Average productivity
for system of this type is: 620 LOC/person-monthThere are 7 developers-Labor rate is: $
8000per person-month Calculate the total effort and cost required to complete the above
project

Que2:An application has the following:10 low external inputs, 12 high external outputs,
20 low internal logical files, 15 high external interface files, 12 average external inquiries
and a value adjustment factor of 1.10 . What is the unadjusted and adjusted function
point count ?

Que 3:

A project has external inputs (Ei)=20, number of external outputs (Eo)=13, number of external
inquiries (EQ0=50, Number of internal files (IF)=12 and number of external interfaces are 30

Assume the external inputs are average, the number of external outputs is complex and , the
number of external inquiries is simple moreover Number of internal files is simple, number of
external interfaces is complex Assume all other 14 complexity factors are significant calculate
the function point for the above project

Que 4 A software firm is planning to build an embedded system control software consisting of
55,000 lines of code. Using the basic COCOMO model, assume the project belongs to the
Organic mode with a = 2.4, b = 1.05, and an effort adjustment factor (EAF) of 1.15.
What is the estimated effort (person-months) required to develop this software?

Que 5 A company wants to develop a financial data analytics application estimated to


contain 32,000 lines of code. The Basic COCOMO parameters for the Semi-detached mode
are a = 3.0, b = 1.12, and the EAF = 0.95.
Calculate the effort required in person-months.
Que 6 A defense organization is developing a real-time radar tracking system with an
estimated 75,000 LOC. The project falls under the Embedded mode with parameters a = 3.6, b
= 1.20, and EAF = 1.30.
Determine the estimated software development effort (in person-months) using the Basic
COCOMO model.

Que 7 A startup is creating an AI-based voice assistant software, requiring nearly 18,000
LOC. Based on the Basic COCOMO Organic model with a = 2.4, b = 1.05, and EAF = 1.05,
compute the effort needed in person-months.
Que 8 A research company is working on a scientific computation tool estimated to have
90,000 LOC. It falls under the Semi-detached COCOMO mode with a = 3.0, b = 1.12, and an
EAF of 1.10.
What is the total effort (person-months) required to develop the software?

Que9 Calculate Halstead Program Length,Halstead Vocabulary ,Program


Volume,Potential Minimum Volume ,Program Level,Program Difficulty for
the following program

int sort (int x[ ], int n)

{
int i, j, save, im1;
/*This function sorts array x in ascending order */
If (n< 2) return 1;
for (i=2; i< =n; i++)
{
im1=i-1;
for (j=1; j< =im1; j++)
if (x[i] < x[j])
{
Save = x[i];
x[i] = x[j];
x[j] = save;
}
}
return 0;
}
Q:10 Calculate the Halstead Program Length, Halstead Vocabulary, Program Volume,
Potential Minimum Volume, Program Level, and Program Difficulty for the following
program:
int findMax(int a[], int n)
{
int i, max;

// Find the maximum element in array


if (n < 1)
return -1;

max = a[0];

for (i = 1; i <= n; i++)


{
if (a[i] > max)
{
max = a[i];
}
}
return max;
}

You might also like