Question 9
Consider the method below:
Consider the problem of finding a set of test cases which satisfies RICC for the method compute. Which of the following statements is true?
Please note that the variable t needs to be re-written in terms of inputs in the second predicate to achieve various coverage criteria. We use the predicate x < y to represent t.
We get some feasible pairs when predicate p = (t || z == 0) being true and also when p = (t || z == 0) being false.
We get some feasible pairs when predicate p = (t || z == 0) being true. But no feasible pairs when p = (t || z == 0) being false.
We get some feasible pairs when predicate p = (t || z == 0) being false. But no feasible pairs when p = (t || z == 0) being true.
No feasible pairs when predicate p = (t || z == 0) being true, and also when p = (t || z == 0) being true.