Domain Partitioning Flashcards
T/F Requirements specifications may be informal, rigorous, and/or formal
T
Subdivide the input domain into a relatively small
number of subdomains
Equivalence partitioning
T/F Partition -> subdomains are disjoint
T
What does disjoint mean?
No overlap
What is each subset known as?
Equivalence class
T/F We could base equivalence classes on the outputs generated by a program
T
One input variable at a time
Unidimensional Partitioning
T/F Multidimensional partitioning can become too
large
T
Focuses on tests at and near the boundaries of equivalence classes
Boundary value analysis
T/F If you expect the same result from two tests, use only one of them
T
T/F When you choose representatives of a class for testing, always pick the ones you think the program is least likely to fail
F, most likely to fail
T/F The best cases are at the boundaries of a class
T
A systematic approach to generation of tests
from requirements
Category-Partition Methods
T/F When you choose representatives of a class for testing, always pick the ones you think the program is most likely to fail
T
T/F Category-partition methods transforms requirements into test specifications
T