B.Tech Dec2022 Comp CSPC-27 Sem3
B.Tech Dec2022 Comp CSPC-27 Sem3
THEORY EXAMINATION
ROLL NO.
Date of the Examination: 24-12-2022 Programme: ....B.Tech
Semester...3'd Subject: Software Engineering
Maximum Marks...50.........
Number of Questions to be attempted...05... Time allowed...3 Hours.
Total No. of Questions.........05... Total No. of Pages used...2....
Instructions: l. All questions are compulsory.
2. I\4arks fbr every part of question are indicated against it.
Ql. (A) Assume a ticket reservation is an association between a passenger and a seat. Select a 5
few necessary attributes for each of these entity types and represent this ticket reservation in
an ER diagram.
(B) What do you understand with the term "Requirement documentation"'] Discuss SRS 5
along with their characteristics.
Q2. (A) Suppose NIT wants to automato B.Tech result management system and it is clear from 5
requirements that there will be five modules of size:8KLOC, I0KLOC, 12 KLOC, ll
KLOC and 13 KLOC respectively. Assume significant cost drivers such as:-
Software reliability is high( l. I 0), 5
Product complexity is high(1.15),
Analyst capability is high(0.88),
Programming language experience is low (1.08), and all the other cost drivers are nominal.
Identifu and apply appropriate COCOMO model to determine the overall cost of the above
project.
@) Define the term software design and computational formulas for cohesion and coupling.
Also discuss types of coupling in terms of software design. For a good design, the model
should have low coupling and high cohesion, why?
Q3. (A) Explain spiral model of software development life cycle (SDLC). Alsg Discuss the pros 5
and cons ofsuch a model.
(B) List out the components of a software along with the software and hardware curves with 5
neat and clean diagram.
Q4. (A) Implement a program for the determination of division of a student. Its input is a triple
of positive integers (markl, mark2, mark3) and values are from interval [0,100]. The output
may be one of the following words ['t division with distinction, I'r division,2od division,
3'd division, 3'd division with grade D, fail, and Invalid marksl. The grading is done as given
below:
Averase marks Grade
85- l 00 I't division with distinction
75-84 l"t division
65-74 2nd division
50-64 3'd division
40-49 3'd division with grade D
0-40 Fail
Qs. (A) Assume that a program will experience 100 failures up to this time. The failure intensity
decay parameter is 0.02/failures. The initial failure intensity was 20 failures/CPU hr.
i. Determine the current failure intensity.
ii. Find the decrement of failure intensity per failure. t
iii. Calculate the failure experienced and failure intensity after 20 and 100 CPU hrs of
execution.
ir'. Compute additional failures and additional execution time required to reach the
failure intensity objective of 2 failures/CPU hr.
Use logarithmic Poisson Execution time model for the above-mentioned calculations.
(B)Explain Jelinski-Moranda Model of reliability theory. What is the relation befween t and 5
),'l Consider there are 200 errors estimated to be present in a program. We have experienced
70 errors. Use the above model to calculate failure intensity with a given value of $:0.05.
What will be the failure intensity after the experience of 60 errors'l