05-02-2013, 12:19 PM
III B.Tech I Semester Examinations,May 2011 SOFTWARE TESTING METHODOLOGIES
Semester.pdf (Size: 68.92 KB / Downloads: 28)
1. Explain the following in the context of node reduction procedure:
(a) Cross term step
(b) Parallel term step
© Loop term step. [16]
2. (a) Dene Transaction & Transaction
ow Testing.
(b) Why Transactional
ows are a natural agenda for system reviews?
© Explain the procedure used in Transactional
ow testing? [4+4+8]
3. (a) Explain the process of achieving (C1+C2) coverage.
(b) How do you convert a
ow-chart into a
ow graph.
[8+8]
4. (a) What are the principles of state testing? Explain its advantages and disad-
vantages.
(b) What is nate state machine and a state? [8+8]
5. (a) Dene Software bug.
(b) Dene Pesticide Paradox and Complexity barrier.
© Explain dierent phases of tester's mental life. [2+6+8]
6. What is a decision table and how does it is useful in testing. Explain it with help
of an example. [16]
7. (a) Write an algorithm for Node Reduction (General).
(b) Illustrate the applications of Node Reduction algorithm. [8+8]
8. (a) Explain the acronym Closed O Outside, Open O Inside ( COOI) in
domain testing.
(b) Explain Span-Compatibility in domains and Interface testing.