Uni.
RN
UNITED COLLEGE OF ENGINEERING & RESEARCH, PRAYAGRAJ Department of Computer Science
(010) Engineering/ Information Technology
Second Sessional Examination (Even Semester 2022-23) SEMESTER: 6th Date:-22/05/2023
TIME: 2 hours. SUBJECT : SOFTWARE ENGINEERING Paper code: KCS -601 MM. 30
READ ALL INSTRUCTIONS AND QUESTIONS VERY CAREFULLY
Bloom’s
SECTION A (Attempt all questions) Very short answer [5] CO
Taxonomy Level
Distinguish between alpha and beta testing. L4(Analyze)
1 a [1] 4
Distinguish between verification and validation. L4(Analyze)
1 b [1] 4
Define software re-engineering. L1(Remember)
1 c [1] 5
Explain Adaptive and Corrective Maintenance. L2(Understand)
1 d [1] 5
Distinguish between product and process metrics. L4(Analyze)
1 e [1] 3
SECTION B (Attempt any two questions) Long answer [10]
Explain black box testing. Is it necessary to perform this? Explain
2 [5] 4 L2(Understand)
various test activities.
Define Integration Testing. Explain different approaches used for
3 integration testing.
[5] 4 L1(Remember)
Define “Formal Technical Review”. Should it access both programming
4 [5] 4 L1(Remember)
style as well as correctness of software? Give reasons.
SECTION C (Attempt any two questions) Long answer [10]
Explain various software configuration management activities.
Describe COCOMO model. Suppose a project is to be developed in
5 [5] 5 L2(Understand)
organic mode and you have estimated the size of product to be about
100,000 LOC. Compute the nominal effort and development time.
Explain Risk Management and also explain how to select the best
6 [5] 5 L2(Understand)
reduction technique when there are many ways for reducing the risk.
Demonstrate the need and category for maintenance in software
7 [5] 5 L3(Apply)
maintenance.
SECTION D (Attempt any one question) Long answer [5]
Describe different types of coupling and cohesion. How design
8 [5] 3 L2(Understand)
evaluation is performed?
Explain Token Count. For the following ‘C’ program estimate the
Halstead’s Length and volume measures of size with LOC measure.
int x,y;
{
9 while (x ! = y) [5] 3 L3(Apply)
if(x > y) then x = x-y;
else y = y -x;
return x;
}
Course Outcome CO1 CO2 CO3 CO4 CO5
Wise Marks
- - 11 17 17
Distribution
Bloom’s Taxonomy Wise L1 L2 L3 L4 L5 L6
Marks Distribution 11 21 10 3 - -
