0% found this document useful (0 votes)
44 views2 pages

Stqa CT-QP

This document is a class test for a software testing and quality assurance course. It contains two questions assessing various software testing concepts and techniques. Question 1 has four subparts asking about when to use an Ishikawa diagram, the differences between validation and verification with examples, and the principles of statistical quality control and associated tools. Question 2 has two subparts involving a mutation testing example calculating the mutation score and assessing test adequacy, and drawing the control flow graph and generating test cases to satisfy coverage criteria for a binary search routine.

Uploaded by

JAS
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)
44 views2 pages

Stqa CT-QP

This document is a class test for a software testing and quality assurance course. It contains two questions assessing various software testing concepts and techniques. Question 1 has four subparts asking about when to use an Ishikawa diagram, the differences between validation and verification with examples, and the principles of statistical quality control and associated tools. Question 2 has two subparts involving a mutation testing example calculating the mutation score and assessing test adequacy, and drawing the control flow graph and generating test cases to satisfy coverage criteria for a binary search routine.

Uploaded by

JAS
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
You are on page 1/ 2

2CSDE80-STQA

Nirma University
Institute of Technology
Class Test, September 2021
B.Tech CSE, Semester: VII (Department Elective)
2CSDE80: Software Testing and Quality Assurance

Roll/ Supervisor’s initial


Exam No with date

Time: 1 Hour and 15 minutes Max Marks: 35


______________________________________________________________________________
Instructions:
(i) Attempt all questions.
(ii) Figures to the right indicate full Marks.
(iii) Draw neat sketches wherever necessary.
(iv) Assume necessary data wherever required.

Q.1 Answer the following. [20]


A. When should the Ishikawa diagram be used? Provide a procedure to [05]
CO1, construct an Ishikawa diagram.
BL1
B. Explain the differences between validation and verification with any [05]
CO1, two examples.
BL2
C. A software engineering group is developing a mission-critical software [05]
CO2, system that will launch laser-guided missiles to its destinations. This
BL4 is a new kind of product that was never built by the company. As a
quality assurance manager, which code review methodology—
walkthrough or inspection—would you recommend? Justify your
answer.

D. Explain the principles of statistical quality control. What are the tools [05]
CO4, used for this purpose?
BL2

Q. 2 Do as directed. [15]
A test engineer generates 70 mutants of a program P and 150 test
A
CO2, cases to test the program P. After the first iteration of mutation
BL4 testing, the tester finds 58 dead mutants and 4 equivalent mutants. [05]
Calculate the mutation score for this test suite. Is the test suite
adequate for program P? Should the test engineer develop additional
test cases? Justify your answer.

Page 1 of 2
2CSDE80-STQA

B For the given binary search routine, answer the following [10]
CO3, questions.
BL5
int binsearch (int X, int V[ ], int n) {
int low, high, mid;
low = 0;
high = n - 1;
while (low <= high) {
mid = (low + high)/2;
if (X < V[mid])
high = mid - 1;
else if (X > V[mid]) low = mid + 1;
else
return mid;
}
return -1;
}

(a) Draw a CFG for binsearch().


(b) From the CFG, identify a set of entry–exit paths to satisfy the
complete statement coverage criterion.
(c) Identify additional paths, if necessary, to satisfy the complete
branch coverage criterion.
(d) For each path identified above, derive their path predicate
expressions.
(e) Solve the path predicate expressions to generate test input
and compute the corresponding expected outcomes.

***********************

Page 2 of 2

You might also like