- Referring to pages 66 and 67 of
Introducing Combinatorial Testing in a Large Organization,
by Hagar, J.D. ; Wissink, T.L. ; Kuhn, D.R. ; Kacker, R.N.,
Computer (Volume:48 , Issue: 4 ),
Page(s): 64 - 72,
Apr. 2015, one question that comes to mind is whether not Figure A is
correct. A full investigation of it is beyond the scope of this quiz,
but we can do a bit of spot checking, specifically
- a) Looking at combinations involving the variables A, B, and J (in that
order), which rows handle each of the following 8 possible values for this
triplet (write row numbers to the right of corresponding value):
A B J -- corresponding rows 0 0 0 -- 0 0 1 -- 0 1 0 -- 0 1 1 -- 1 0 0 -- 1 0 1 -- 1 1 0 -- 1 1 1 --

- b) If did this sort of checking for every possible three-way combination of 10 binary values, how many such combinations would we have to check? Why?

- a) Looking at combinations involving the variables A, B, and J (in that
order), which rows handle each of the following 8 possible values for this
triplet (write row numbers to the right of corresponding value):
- Referring to pages of
Software Debugging, Testing, and Verification, by
Brent Hailpern and Padmanabhan Santhanam,
RC22220 (W0110-083) October 31, 2001,
IBM Research Report, in Section 4, Conclusions, the authors talk about
unstated assumptions, which they didn't talk about in the paper itself.
- a) How is an `unplanned for device driver' an example of an unstated assumpion?
- b) What would be an example of an `unstated assumption' that they don't give on these pages of the paper?

- Referring to the Evaluation spec derived from the course outline and
the notes on the classes analysis of that spec, we have not made much progress
on it since the beginning of the semester. The notes show 5 constraints
(4 of which we developed in class and the 5th was just added to finish off
the possible situations that needed to be covered). Constraints 2 thru 5
are basically the constraints that relate OG, PG, and B. Below I ask you
for three more groups of constraints. If possible, write your constraints
in the style used on the accompanying printout. If not, write your
constraints in clear direct English. For these answers, we are ignoring
the possibility of the value SKIP occurring among the input variables.
- a) What constraints are necessary to relate PG, FM, B, QM, PM, and RM?
- b) Relating QM to Q us tricky because FINAL is a valid value for Q[i]. The way this is handled is to assume a new set of variables Qnew[1..4] where the FINALs have been replaced by the appropriate value where necessary. What constraints are necessary to relate Qnew and Q?
- c) Having connected Qnew and Q, what constraints are necessary to relate Qnew and QM?