Assume you have two input variables x1 and x2. The valid value spaces of each input variable are split into three equivalence classes as shown below:
x1: EC1=(min-int, 0); EC2={0}; EC3=(0, max-int)
x2: EC4=(min-int, 0); EC5={0}; EC6=(0, max-int)
What set of test cases (input side) covers all possible combinations of valid input equivalence classes?

Question

Assume you have two input variables x1 and x2. The valid value spaces of each input variable are split into three equivalence classes as shown below: 
 x1: EC1=(min-int, 0); EC2={0}; EC3=(0, max-int) 
 x2: EC4=(min-int, 0); EC5={0}; EC6=(0, max-int) 
 What set of test cases (input side) covers all possible combinations of valid input equivalence classes?

Accepted Answer

{(-1, -1), (0, -1), (1, -1), (-1, 0), (0, 0), (1, 0), (-1, 1), (0, 1), (1, 1)}

Answer

{(-2, -1), (0, -1), (-1, 0), (0, 0), (1, 0), (0, 1), (1, 2)}

Answer

{(-1, -1), (0, 0), (1, 1)}

Answer

{(-1, -1), (0, -1), (1, -1), (-1, 0), (1, 0), (-1, 1), (0, 1), (1, 1)}

Crowdly

Assume you have two input variables x1 and x2. The valid value spaces of each in...

Want instant access to all verified answers on moodle.ut.ee?