It is not realistic - from a combinatoric point of view - to test a program unit on all possible inputs
Therefore, the choice of input values to black box testing is an important concern
An equivalence partitioning splits a set of input values in a (small) number of classes. It is hypothesized that it is sufficient to test the program unit on a single representative from each class
An equivalence partitioning splits a set of input values in a (small) number of classes.
It is hypothesized that it is sufficient to test the program unit on a single representative from each class