Jawaharlal Nehru Technological University Kakinada 2009-2nd Sem B.Tech Code No: Q0502/R05 III Supplementary s, / SOFTWARE TESTING METHODOLOGIES ( Common to Computer Science & Engineering and I

Code No: Q0502/R05
III B.Tech II Semester Supplementary Examinations, Nov/Dec 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) Why is it impossible for a tester to obtain all the bugs in a system? Why might
it not be necessary for a program to be completely free of defects before it is
delivered to its customers?
(b) To what extent can testing be used to validate that the program is t for its
purpose? explain.
[10+6]

2. (a) What is meant by program's control ow? How it is useful for path testing?
(b) explain different ow graph elements with their notations. [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 nice domains and ugly domains with suitable examples. [16]

5. discuss about Regular Expressions and Flow-Anomaly Detection. [16]

6. (a) How can we determine paths and domains in the logic-based testing?
(b) How the Boolean expressions can be used in the test case design? [8+8]

7. Write short notes on:
(a) Transition bugs
(b) Impact of bugs
(c) State bugs.
[16]

8. elaborate graph matrices and their applications?
[16]

Earning:   Approval pending.