Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from Foundations of Software Testing: Fundamental Algorithms and Techniques
EXERCISES
EXERCISES
7.1 Given program P in programming language L and a nonempty
set M of mutation operators, what is the smallest number of
mutants generated when mutation operators in M are applied
to P?
7.2 (a) Let D and R denote, respectively, the sets of elements in the
domain of mutation operator M. Suppose that program P
contains exactly one occurrence of each element of D and that
D = R. How many mutants of P will be generated by applying
M? (b) How might your answer to (a) change if D = R?
7.3 Create at least two mutants of Program P7.2 on page 509 that
could lead to an incorrect signal sent to the caller of procedure
checkTemp. Assume that you are allowed to create mutants by
only changing constants, variables, arithmetic operators, and
logical ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951