Training: Black Box Techniques

Equivalence Partitioning and Boundary Value Analysis - 1 hour
Equivalence Partitioning and Boundary Value Analysis are two of the most common test case design techniques which are being used by many people but probably not to their full potential. Learn how Equivalence Partitioning can be used to reduce the number of test cases and yet still find those important bugs. Also learn the differences between 2-value and 3-value Boundary Value Analysis and why the 2-value method can be more effective at finding bugs. Although you might have been using EP and BVA already, this session will provide a structured and systematic approach in the use of these techniques.

RETURN TO CREATE A COURSE

Decision Tables - 1 hour

Requirement specifications often have very complex business rules which need to be tested. Decision Tables provide a useful framework to help the tester explore various combinations of business rules ensuring important combinations are not overlooked. Learn how to reduce the maximum number of combinations to a manageable size using a technique called rationalisation. This session shows how the concept of Decision Tables can be extended to include values as well as "true" and "false".

RETURN TO CREATE A COURSE

State Transition Testing - 1 hour

This technique is seldom used by testers in an effective way, which is disappointing because of its powerful modelling capabilities as well as the levels of coverage that can be achieved. Learn the differences between 0-switch, 1-switch, 2-switch and n-switch coverage and why a more detailed level of coverage is often required even though it produces a lot more tests that are seen to be unrealistic. This session will also look at how negative tests can be designed using the "State Table" which can ultimately test the robustness of the system.

RETURN TO CREATE A COURSE

Classification Trees - 1 hour

Classification Trees is a relatively new test case design technique based upon the category- partitioning method. Although it is often considered as a similar technique to Equivalence Partitioning, it is however very different in lots of ways. Its visual nature, free tool support and easy to maintain and understand test cases makes this a test case design technique that every tester should have and master within their "toolbox of techniques". During the session learn how to differentiate between class coverage and combination coverage and how to use intelligence in applying dependency rules to reduce the maximum number of test cases that can be produced.

RETURN TO CREATE A COURSE

Pairwise Testing - 1 hour
Organisations are often presented with a large problem when vast numbers of combinations of inputs and pre-conditions need to be tested. Testing all combinations is usually not practical due to time limitations and also some combinations maybe considered as infeasible. One of the main principles of software testing is that "exhaustive testing is often impossible". If you find yourself in this situation then pairwise testing could be the answer to this combinatorial nightmare. Learn the differences between Orthogonal Arrays and Pairwise Algorithms and why they produce varying numbers of test cases to achieve the same objective and whether this is significant.

RETURN TO CREATE A COURSE

Syntax Testing - 30 minutes
This technique is mainly used by the development team in testing syntax of input and output fields. Data formats are converted into many data validation tests (positive and negative) and are expressed in a formal notation such as the Backus-Naur form. This technique is useful when confronted with syntax fields such as post codes and telephone numbers. Learn how positive testing will generate a finite number of tests yet negative testing using this technique can generate an infinite number of potential tests.

RETURN TO CREATE A COURSE