|
 Notes > Software Analysis / Testing > Classification Tree Method
|
The Classification Tree Method allows an approach similar to Partition Analysis to be undertaken. The Classification Tree Method provides a formal method for representing test cases graphically / visually. This is particularly useful as informal specifications can become overly complex for larger systems.
The tester will decide upon a set of classification aspects which are viewed as relevant to the testing of the system. These classification aspects have a set of values (classes) associated with them which are to be treated the same way in testing. These classes are similar to the sub-domains in Partition Analysis.
The difference between the Classification Tree Method and Partition Analysis is the representation. An example Classification Tree is shown below. This Classification Tree was built using the Classification Tree Editor - CTE XL.
The top node in a Classification Tree is known as the root node. The next level down contains various classification aspects. Below these come the classes or abstract test cases from which actual test data can be developed. As shown in the diagram above, the Classification Tree Method allows for sub-classifications to be added below certain classes.
Search for "Classification Tree Method" on:
Google |
Kelkoo |
Amazon |
eBay (UK) |
eBay (US)
Search for "Classification Tree Method" on the rest of Computing Students: Classification Tree Method
|
|
|
