{"id":5257,"date":"2014-10-14T09:35:00","date_gmt":"2014-10-14T09:35:00","guid":{"rendered":"https:\/\/www.intexsoft.com\/?post_type=blog&p=5257"},"modified":"2022-07-19T12:47:19","modified_gmt":"2022-07-19T12:47:19","slug":"pairwise-testing","status":"publish","type":"blog","link":"https:\/\/intexsoft.com\/blog\/pairwise-testing\/","title":{"rendered":"Pairwise Testing Explained"},"content":{"rendered":"
\n\t
\n\t\t\t\t\t
<\/div>\n\t\t\t\t
\n\t\t\t\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t<\/div>\n\t\t\t<\/a>\n\t\t\t
October 14, 2014 \u2022 by \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tAlexandra\n\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t

Pairwise Testing Explained<\/h1>\n\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\tTech Staff\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\"image\"\n\t\t\t\t<\/picture>\n\t\t\t<\/div>\n\t\t\t<\/div>\n<\/section>\n\t\t\t\t\t\t\t\n\t\t\n\n\n
\n
\n\t\t
\n\n\n\n\t\t\t\t\t\t\t\n\t\t\t\t
\n\t\t\t\t<\/div>\n\t\t\t\t\t\t

When to use pairwise comparisons?<\/h2>\n

 <\/p>\n

Let our program take a dozen parameters. To test all combinations is very difficult, so you should choose the most common and potentially affecting each other. Bugs that arise by a particular combination of all ten parameters are rare.<\/span><\/p>\n

 <\/p>\n

The most common are bugs that arise by a particular combination of two parameters. The more information about the mutual influence of the parameters (more precisely \u2013 of the mutual non-influence), the more combinations we can not test. In the absence of such information, as well as by complex algorithms of program behavior, you should apply the method of<\/span> pairwise testing<\/a>.<\/p>\n

 <\/p>\n

Pairwise testing example<\/h2>\n

 <\/p>\n

Thus, we can simplify our task and test all the possible values \u200b\u200bfor each pair of parameters.<\/span><\/p>\n

 <\/p>\n

Let\u2019s consider an example. Suppose we have three input parameters \u2013 3 checkboxes. The number of all possible combinations \u2013 2 to Grade 3 Total 8, then you need to do 8 tests. Let\u2019s try to save time by testing the check boxes in pairs.<\/span><\/p>\n

 <\/p>\n

We test two pairs of parameters: the first with the second and second to the third with the help of 4 sets of input data (4 tests). It remains to test the couple of \u201cfirst to the third.\u201d<\/span><\/p>\n

 <\/p>\n\"\"<\/a>\n

 <\/p>\n

We bring the second column to its rightful place. It turns out that the last 2 tests can be run at any values \u200b\u200bof the second parameter.<\/span><\/p>\n

 <\/p>\n

For certainty, we can add the zeros in these blanks:<\/b><\/span><\/p>\n

 <\/p>\n\"\"<\/a>\n

As a result, we obtain 6 instead of 8 tests for a complete listing. Can you save more? You can.<\/span><\/p>\n

 <\/p>\n\"\"<\/a>\n

 <\/p>\n

Wow! What do we see? By changing the order of the values \u200b\u200bin column 3, we combined the 2-nd and 3-rd and 1-st to 3-rd parameters.<\/span><\/p>\n

 <\/p>\n

Total, there ate only 4 lines, i.e. 4 tests, equivalent to the original 6:<\/b><\/span><\/p>\n

 <\/p>\n

Exhaustive search of all possible combinations in the third column is guaranteed to give the minimum number of tests. However, judging by the fact that such minimizing algorithms are still developed, an exhaustive search is not acceptable because of too big time costs. There are programs that give acceptable results in reasonable time, such as PICT program from Microsoft, Allpairs etc. But more about that we\u2019ll talk next time. If you\u2019d like we apply our experience and knowledge to make your software better, you might be interested in our software testing service.<\/span><\/p>\n\n\t\t<\/div>\n\t<\/section>\n\n\n\n

\n\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t\t\t

WRITTEN BY<\/h3>\n\t\t\t\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\"image\"\n\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t

Alexandra<\/h4>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t
Marketing Manager<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t<\/section>\n\n\n