Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Rr411205 Software Testing Methodology

# Rr411205 Software Testing Methodology

Ratings:
(0)
|Views: 243|Likes:

### Availability:

See more
See less

08/02/2014

pdf

text

original

Code No: RR411205
Set No. 1
IV B.Tech I Semester Supplimentary Examinations, February 2008
SOFTWARE TESTING METHODOLOGY
(Information Technology)
Time: 3 hours
Max Marks: 80
All Questions carry equal marks
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
1. What are the principles of test case design? Explain.
[16]
2. Categorize di\ufb00erent kinds of loops and explain
[16]
3. (a) De\ufb01ne a transaction. Give an example.
(b) How does Transaction \ufb02ows occur , illustrate with help of examples. [2+14]
4. (a) What is the di\ufb00erence between Linear and Nonlinear Boundaries? And Ex-
plain?
[8+8]
5. Write short notes on

(a) Path Products
(b) Path Expressions.
(c) Path Sums

(d) Loops
[4+4+4+4]
6. Reduce the following functions using Karnaugh Map method
F(A,B,C,D)=\u03c0 (4,5,6,7,8,12,13)+d(1,15)
[16]
7. (a) Di\ufb00erentiate between good state graphs and bad state graphs.
(b) What are principles of state testing? Explain its advantages and disadvan-
tages.
[8+8]
8. (a) Write an algorithm for Node Reduction (General).
(b) Illustrate the applications of Node Reduction algorithm.
[8+8]
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
1 of 1
Code No: RR411205
Set No. 2
IV B.Tech I Semester Supplimentary Examinations, February 2008
SOFTWARE TESTING METHODOLOGY
(Information Technology)
Time: 3 hours
Max Marks: 80
All Questions carry equal marks
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
1. List out various Dichotomies and Explain.
[16]
2. (a) Explain about path instrumentation. How does Link Counters are useful in
Path Instrumentation method.
(b) Write about implementation of path testing and What are the various appli-
cations of path testing.
[10+6]
3. (a) Implementation of a transaction \ufb02ow is usually implicit in the design of the
systems control structure & Database, Explain.
(b) Discuss about sensitization & instrumentation based on transaction \ufb02ows.
[8+8]
4. What is domain testing? Discuss applications of domain testing?
[16]
5. Write short notes on

(a) Path Products
(b) Path Expressions.
(c) Path Sums

(d) Loops
[4+4+4+4]
6. What is decision table and how does it is useful in testing. Explain it with help of
an example.
[16]
7. Explain State graphs with implementation .
[16]
8. Write relative merits and demerits of di\ufb00erent Graph Matrix representations. [16]
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
1 of 1
Code No: RR411205
Set No. 3
IV B.Tech I Semester Supplimentary Examinations, February 2008
SOFTWARE TESTING METHODOLOGY
(Information Technology)
Time: 3 hours
Max Marks: 80
All Questions carry equal marks
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
1. De\ufb01ne testing and explain the purpose of testing.
[16]
2. Discuss about di\ufb00erent kinds of predicate blindness.
[16]
3. (a) How an Anomaly can be detected. Explain deferent types of data \ufb02ow anom-
alies and Data \ufb02ow anomaly state graphs.
(b) Write applications of data \ufb02ow testing.
[13+3]
4. What is domain testing? Discuss applications of domain testing?
[16]
5. Write short notes on

(a) Path Products
(b) Path Expressions.
(c) Path Sums

(d) Loops
[4+4+4+4]
6. (a) Minimize the function using Karnaugh Map method
F(A,B,C,D)=
\ue000
(1,2,3,8,9,10,11,14)+
\ue000
d(7,15)
(b) Demonstrate by means of truth tables the validity of the following theorems
of Boolean algebra

i. Associative laws
ii. Demorgans theorems for three variables
iii. Distributive law of + over.

[8+8]
7. Explain state testing and testability tips.
[16]
8. What are graph matrices and their applications.
[16]
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
1 of 1