Scribd
Upload
52 views4 pages

9A05702 Software Testing

useful

Uploaded by

prasanthikasamsetty
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
52 views4 pages

9A05702 Software Testing

useful

Uploaded by

prasanthikasamsetty
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/ 4

1

Code: 9A05702

B.Tech IV Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

SOFTWARE TESTING
(Common to CSE & IT)
Time: 3 hours

Max. Marks: 70
Answer any FIVE questions
All questions carry equal marks
*****

(a)
(b)
(c)
(d)

Give differences between functional testing and structural testing.


Specify on which factors the importance of bugs depends and give the metrics for it.
Briefly explain the various consequences of bugs.
What are the remedies for test bugs?

(a) Explain about path instrumentation. How are link counters useful in path instrumentation
method?
(b) Write about implementation of path testing and what are the various applications of path
testing.

(a) Write about KV charts. Explain them with three and four variables.
(b) Obtain the simplified expressions in SOP for the following Boolean function using Karnaugh
maps:
(i)
(ii)

Explain the domain boundary bugs for two dimensional domains.

(a) Implementation of a transaction flow is usually implicit in the design of the systems control
structure and database, explain.
(b) Discuss about sensitization and instrumentation based on transaction flows.

(a) Whether all predicates are restricted to binary truth value or not? Explain.
(b) Illustrate the applications of decision tables.

7
8

Explain state graphs with implementation.


(a) Write the partitioning algorithm.
(b) Write an algorithm for all pairs of paths using matrix operations.

*****

Code: 9A05702

B.Tech IV Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

SOFTWARE TESTING
(Common to CSE & IT)
Time: 3 hours

Max. Marks: 70
Answer any FIVE questions
All questions carry equal marks
*****

Define testing and explain the purpose of testing.

(a) How a programs control structure can be represented graphically? Explain with the help of
diagrams.
(b) How a flowchart differs from a control flow graph?
(c) Explain about multi entry and multi exit routines and fundamental path selection criteria.

Write short notes on the following:


(a) Transaction dispatcher
(b) Self test support
(c) Transaction control block

Classify what can go wrong with boundaries then define a test strategy for each case in
domain testing.

5
(a)
(b)
(c)
(d)
6

Write short notes on:


Path products
Path expressions
Path sums
Path loops

(a) Write about KV charts. Explain them with three or four variables.
(b) Obtain the simplified expressions in SOP for the following Boolean functions using Karnaugh
maps:
(i)
(ii)

(a) Write an algorithm for node reduction.


(b) Illustrate the applications of node reduction algorithm.
Write relative merits and demerits of different graph matrix representations.

*****

Code: 9A05702

B.Tech IV Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

SOFTWARE TESTING
(Common to CSE & IT)
Time: 3 hours

Max. Marks: 70
Answer any FIVE questions
All questions carry equal marks
*****

List out various dichotomies and explain.

2
(a)
(b)
(c)
(d)
3

Describe the following concepts:


Predicates
Predicate expression
Predicate coverage
Achievable paths

(a) Implementation of a transaction flow is usually implicit in the design of the systems control
structure and database, explain.
(b) Discuss about sensitization and instrumentation based on transaction flows.
Why the domain testing in easy for one dimension and difficult for two dimensions?

(a) Define structured code. Explain lower path count arithmetic.


(b) What is the looping probability of a path expression? Write arithmetic rules and explain with an
example.

(a) Minimize the function using Karnaugh map method:


(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 over

7
8

What are the principles of test case design? Explain.


(a) Write about building tools of graph matrices.
(b) What are relations and give their properties?

*****

Code: 9A05702

B.Tech IV Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

SOFTWARE TESTING
(Common to CSE & IT)
Time: 3 hours

Max. Marks: 70
Answer any FIVE questions
All questions carry equal marks
*****

What are domain bugs? How to test them?

Discuss about different kinds of predicate blindness.

Name and explain data flow testing strategies.

(a) Explain nice and ugly domains.


(b) Describe the interior point, boundary point and extreme point.

(a) Define structured code. Explain lower path count arithmetic.


(b) What is the looping probability of a path expression? Write arithmetic rules and explain with an
example.

(a) Write Boolean algebra rules. Illustrate the rules with path expressions.
(b) Use a Karnaugh map to minimize

(a) Differentiate between good state graphs and bad state graphs.
(b) What are principles of state testing? Explain its advantages and disadvantages.

(a) Define structured code. Explain lower path count arithmetic.


(b) What is the looping probability of a path expression? Write arithmetic rules and explain with an
example.

*****

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy