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

Question

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

Answer

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

Answer

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

Answer

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

Answer

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

Crowdly

Assume you have three input variables x1, x2, and x3. The value spaces of each i...

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