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

EXERCISES

each case? (c) Are the combinations generated in (b) unique in the

sense that another set of combinations would also be satisfactory

and as small in number?

2.23 Construct a sample implementation

I to show that the

application of heuristic H

2

from Table 2.4 will leave out at least

one test that would have detected the error in

I.

2.24 Consider the following modified versions of heuristics H

1

and H

4

given in Table 2.4.

H

1

: Enumerate any one combination of inputs to n

1

and n

2

such

that n

1

= n

2

= 0.

H

4

: Enumerate all combinations of inputs to n

1

and n

2

such that

n

1

= n

2

= 1.

Discuss why the above modifications are undesirable (or

desirable).

2.25 Complete Example 2.19 by (a) creating a decision table using

procedure CEGDT in Section 2.6.3; apply heuristics from ...