Equivalence partitioning and boundary value analysis practice
Unlimited generated problems with instant feedback. Find the partitions, pick the boundary values, and count the tests, the way the CTFL 4.0 exam asks.
Tip: read the rule for the word “inclusive” or “at least”. They decide which number is the last valid one.
The idea in a minute
Equivalence partitioning splits the possible values of an input into groups (partitions) that the software should treat the same way. If one value in a partition works, the others probably do too, so you test at least one value from each partition. Valid partitions hold values the system accepts; invalid partitions hold values it should reject.
Boundary value analysis adds the edges of each ordered partition, because defects like to hide where the rule changes. With 2-value BVA you test each boundary value and its closest neighbor in the next partition. With 3-value BVA you also test the neighbor on the other side.
A worked example
A discount applies to ages 18 to 25, inclusive. There are three partitions: under 18 (invalid), 18 to 25 (valid), and over 25 (invalid). 2-value boundary values: 17, 18, 25, 26. 3-value boundary values: 17, 18, 19, 24, 25, 26.
Ready for a whole exam?
Practice on the real exam screen with full CTFL 4.0 practice exams. Your first one is free.