SWE 437 Homework 4
Fall 2018
Input Space Partition Testing

For this assignment, you have a choice. Do one of the following two exercises.
  1. Download and use a combinatorial testing tool to generate combinatorial tests for some artifact of your choosing. You can start looking at the Pairwise Testing site, or you can go directly to a specific tool such as the NIST ACTS.
    Turn in a brief report that convinces me that you had the tool running and also reflects on the attributes of the resulting tests (e.g. how many, what happened with constraints, etc.)
  2. Consider the patternIndex() function.

    Build a set of JUnit tests that satisfies either PWC or BCC (your choice). I suggest you choose a fairly simple input domain model so that the deliverable, described below, is not of undue complexity.

    Your deliverable is a story that convinces the GTA (or me) that you actually derived your tests from your input domain model. That is, you will be graded solely on whether you demonstrate an understanding of how input domain models lead to tests in the context of this example. If you simply turn in an IDM or JUnit tests without explanation, your score will be zero.

    An important part of the story is explaining what happens to infeasible test frames. Depending on whether you are using PWC or BCC, you need to do the right thing with them.

This is a great assignment for the collaboration model. Not only will it go faster, but you'll understand it better if you can explain your bit to your teammates.