Jawaharlal Nehru Technological University Kakinada 2009-1st Sem B.Tech Computer Science and Engineering Code No: V3126/R07 I II Regular s, SOFTWARE TESTING METHODOLOGIES ( Common to Comp

Code No: V3126/R07
I II B.Tech I Semester Regular Examinations, November 2009
SOFTWARE TESTING METHODOLOGIES
( Common to Computer Science & Engineering and info
Technology)
Time: three hours
Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
1. (a) explain how software testing will ensure the quality of a developed software.
(b) explain the trade - o ranging from quality assurance costs and manufaturing costs.
[10+6]
2. (a) explain about "Traversal marker" form of path instrumentation.
(b) What is meant by coincidental correctness? provide an example. [8+8]
3. (a) explain the subsequent strategies of data ow testing with suitable examples:
i. All-predicate-uses(APU) strategy
ii. All-computational (ACU) strategy
(b) Compare the path ow and data- ow testing strategies. [8+8]
4. explain in detail the Domains and Interface testing.
[16]
5. discuss the procedure to nd the maximum number of di erent paths possible and
fewest number of paths possible with an illustration.
[16]
6. What is decision table and how is a decision table useful in testing? Also discuss
with the help of an example.
[16]
7. (a) Write designers comments about state graphs.
(b) Write Testers comments about state graphs.
[8+8]
8. (a) Write Partitioning Algorithm.
(b) Write an algorithm for All Pairs Paths using Matrix Operations. [8+8]

Earning:   Approval pending.