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
DIFDL5FNQ. Assume that you are allowed to create mutants by
only changing constants, variables, arithmetic operators, and
logical ...