{"id":103,"date":"2021-10-17T19:27:27","date_gmt":"2021-10-17T19:27:27","guid":{"rendered":"http:\/\/qleaders.net\/?p=103"},"modified":"2021-10-17T19:27:28","modified_gmt":"2021-10-17T19:27:28","slug":"extract-all-requirement-cases-using-causeeffect-analysis","status":"publish","type":"post","link":"https:\/\/qleaders.net\/index.php\/2021\/10\/17\/extract-all-requirement-cases-using-causeeffect-analysis\/","title":{"rendered":"Extract All requirement cases using Cause&Effect Analysis"},"content":{"rendered":"\n

Introduction<\/h2>\n\n\n\n

This article describes in detail an organized method to extract all possible cases from the requirement, this can help the system analyst in defining all the cases and also can help developers while preparing the unit TCs and of course will help the testers to write unified test cases.<\/p>\n\n\n\n

First of all, suppose you have the following requirement:<\/p>\n\n\n\n

A mailing is to be sent out to customers.<\/em><\/p>\n\n\n\n

The content of the mailing is about the current level of discounting and potential levels of discounting. The content is different for different types of customers.<\/em><\/p>\n\n\n\n

Customer Types A, B, and C get a normal letter except Customer Type C, who gets a special letter.\u00a0Any customer with 2 or more current lines or with a credit rating of \u2018X\u2019 gets a special paragraph added with an offer to subscribe to another level of discounting.<\/em><\/p>\n\n\n\n

The problem is if you give this requirement to any 4 different testers, the 4 will produce different no of TCs, I will explain how to derive a unified number of TCs using cause and effect analysis and a decision table.<\/p>\n\n\n\n

Step 1: Break the specification down to cause and effect:<\/h1>\n\n\n\n

First, the analyst must break down the requirement to causes and effects<\/p>\n\n\n\n

\u2013\u00a0Cause:\u00a0is a distinct input condition or an equivalence class of input conditions\u00a0(the cause which triggers the effect) in our above example Customer Type (A, B, C, Other) is a cause<\/p>\n\n\n\n

\u2013\u00a0Effect: is an output condition. Determine the logical relationship between the cause and the effects, in our above example \u201cGet a normal letter\u201d is an effect for the cause customer type(A, B,C, Other )
Usually, the effect is an output action (Ex. Error message, application action, executing specific application job, etc\u2026)<\/p>\n\n\n\n

After this step you should have causes and effects like that:<\/p>\n\n\n\n

C1: Customer Type A, B, C, Other<\/p>\n\n\n\n

C2: 2 or more lines<\/p>\n\n\n\n

C3: Credit Rating<\/p>\n\n\n\n

E1: Normal Letter<\/p>\n\n\n\n

E2: Special Letter<\/p>\n\n\n\n

E4: Add a special paragraph<\/p>\n\n\n\n

E5: Get a Normal letter<\/p>\n\n\n\n

Step 2: Put Causes and Effects in the decision Table.<\/h1>\n\n\n\n

Then we should fill the decision table by putting the cause and the effects together in that table as a following:<\/p>\n\n\n\n

<\/p>\n\n\n\n

Cause\\Effect<\/td><\/td><\/td><\/td><\/td><\/tr>
C1:<\/td><\/td><\/td><\/td><\/td><\/tr>
C2:<\/td><\/td><\/td><\/td><\/td><\/tr>
C3:<\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/tr>
E1:<\/td><\/td><\/td><\/td><\/td><\/tr>
E2:<\/td><\/td><\/td><\/td><\/td><\/tr>
E3:<\/td><\/td><\/td><\/td><\/td><\/tr>
E4:<\/td><\/td><\/td><\/td><\/td><\/tr>
E5:<\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Step 3: Calculate all possible Combinations<\/h1>\n\n\n\n

This is a very important step to know no of columns in our decision table, simply use this formula to know all no of combinations that can occur:<\/p>\n\n\n\n

\u2022 If all causes are simply Y\/N values:
2number of causes<\/sup><\/p>\n\n\n\n

\u2022 If 1 cause with 3 values and 3 with 2:
31<\/sup> * 23<\/sup> = 24<\/p>\n\n\n\n

In our example<\/strong>, C1 has 4 values (A or B or C or Other) AND C2 has 2 values (YES or NO) also C3 has 2 values (YES or NO) so our formula should be :<\/p>\n\n\n\n

14 <\/sup>* 22 <\/sup>= 16 combinations<\/p>\n\n\n\n

So we should draw for the decision table 16 columns which present 16 different combinations.<\/p>\n\n\n\n

Now the table should be like that:<\/p>\n\n\n\n

Cause\\Effect<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C1:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C2:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C3:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E3:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E4:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E5:<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Step 4: Fill Columns<\/h1>\n\n\n\n

We can fill columns 2 methods:<\/p>\n\n\n\n

1-\u00a0Logical method: in this method, you start filling column by column, start with the causes and end up with the effect (put into consideration that every column is a case).<\/p>\n\n\n\n

2- Repeating Factor Algorithm method:<\/p>\n\n\n\n

a. Determine Repeating Factor (RF): divide remaining combinations by the number of possible values for that cause<\/p>\n\n\n\n

b.\u00a0Write RF times the first value, then RF times the next, etc. until the row is full<\/p>\n\n\n\n

Example for using Repeating Factor Algorithm: suppose you have the following decision table:<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C2(Y\\N)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C3(Y\\N)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Fill first row: RF = number of remaining combination (8) \/ possible value for this<\/p>\n\n\n\n

Cause (2) = (8\/2 = 4), so we will fill 4 from Y and 4 of N, the DT will be :<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td>N<\/td><\/tr>
C2(Y\\N)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C3(Y\\N)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Fill Second row: RF = number of remaining combination (4) \/ possible value for this<\/p>\n\n\n\n

Cause (2) = (4\/2 = 2), so we will fill 2 from Y and 2 of N, the DT will be :<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td>N<\/td><\/tr>
C2(Y\\N)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/tr>
C3(Y\\N)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Fill Third row: RF = number of the remaining combination (2) \/ possible value for this<\/p>\n\n\n\n

Cause (2) = (2\/2 = 1), so we will fill 1 from Y and 1 of N, the DT will be :<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td>N<\/td><\/tr>
C2(Y\\N)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/tr>
C3(Y\\N)<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Filing DT in example1:<\/p>\n\n\n\n

In example 1 we have 3 causes and 5 effects with the total number of combinations = 16 combinations<\/p>\n\n\n\n

Fill first row: RF = number of remaining combination (16) \/ possible value for this<\/p>\n\n\n\n

Cause (4) = (16\/4 = 4) , so we will fill 4 from every type (A,B,C,O) , the DT will be :<\/p>\n\n\n\n

Cause\\Effects<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C1(A,B,C,O)<\/td>A<\/td>A<\/td>A<\/td>A<\/td>B<\/td>B<\/td>B<\/td>B<\/td>C<\/td>C<\/td>C<\/td>C<\/td>O<\/td>O<\/td>O<\/td>O<\/td><\/tr>
C2(Yes\\No)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
C3(yes\\No)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E3<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E4<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E5<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Fill Second row: RF = number of remaining combination (2*2) \/ possible value for this<\/p>\n\n\n\n

Cause (2) = (4\/2 = 2), so we will fill 2 from every Y and 2 from N, the DT will be :<\/p>\n\n\n\n

Cause\\Effects<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td>9<\/td>10<\/td>11<\/td>12<\/td>13<\/td>14<\/td>15<\/td>16<\/td><\/tr>
C1(A,B,C,O)<\/td>A<\/td>A<\/td>A<\/td>A<\/td>B<\/td>B<\/td>B<\/td>B<\/td>C<\/td>C<\/td>C<\/td>C<\/td>O<\/td>O<\/td>O<\/td>O<\/td><\/tr>
C2(Yes\\No)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/tr>
C3(yes\\No)<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E3<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E4<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E5<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Fill Third row: RF = number of the remaining combination (2) \/ possible value for this<\/p>\n\n\n\n

Cause (2) = (2\/2 = 1), so we will fill 1 from every Y and 1 from N, the DT will be :<\/p>\n\n\n\n

Cause\\Effects<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td>9<\/td>10<\/td>11<\/td>12<\/td>13<\/td>14<\/td>15<\/td>16<\/td><\/tr>
C1(A,B,C,O)<\/td>A<\/td>A<\/td>A<\/td>A<\/td>B<\/td>B<\/td>B<\/td>B<\/td>C<\/td>C<\/td>C<\/td>C<\/td>O<\/td>O<\/td>O<\/td>O<\/td><\/tr>
C2(Yes\\No)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/tr>
C3(yes\\No)<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E3<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E4<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E5<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Step 5: Reduce Combinations<\/h1>\n\n\n\n

1-\u00a0In our simple example find a don\u2019t care \u201c-\u201d sign and place it,<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td>N<\/td><\/tr>
C2(Y\\N)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/tr>
C3(Y\\N)<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

In the above DT suppose in column 3 and column 4, when the C2 become \u201cN\u201d the program end, so we will put in C3\u00a0the sign \u201c-\u201d which mean done care, the DT will become as follow :<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td>N<\/td><\/tr>
C2(Y\\N)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/tr>
C3(Y\\N)<\/td>Y<\/td>N<\/td>–<\/td>–<\/td>Y<\/td>N<\/td>–<\/td>–<\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

2-\u00a0After placing the \u201c-\u201d don\u2019t care sign, now remove the repeated columns, column 3 and 4 now become identical so will remove one of them, also column 7 and 8 now identical so I will remove one of them too, so the DT will be :<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>5<\/td>6<\/td>8<\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td><\/tr>
C2(Y\\N)<\/td>Y<\/td>Y<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td><\/tr>
C3(Y\\N)<\/td>Y<\/td>N<\/td>–<\/td>Y<\/td>N<\/td>–<\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

After removing the columns you must do a checksum for the table to assure that the DT still<\/p>\n\n\n\n

cover all the original combination = 8<\/p>\n\n\n\n

To do checksum:<\/p>\n\n\n\n

\u2022 For each column calculate the combinations it represents<\/p>\n\n\n\n

\u2022 A \u2018-\u2019 represents as many combinations as the cause has<\/p>\n\n\n\n

\u2022 Multiply for each \u2018-\u2019 down the column<\/p>\n\n\n\n

\u2022\u00a0Add up the total and compare with step 2<\/p>\n\n\n\n

So the checksum will be as follow:<\/p>\n\n\n\n

<\/td>1<\/td>2<\/td>3<\/td>5<\/td>6<\/td>8<\/td><\/td><\/tr>
C1(Y\\N)<\/td>Y<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>N<\/td><\/td><\/tr>
C2(Y\\N)<\/td>Y<\/td>Y<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td><\/td><\/tr>
C3(Y\\N)<\/td>Y<\/td>N<\/td>–<\/td>Y<\/td>N<\/td>–<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E2<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
Checksum<\/td>1<\/td>1<\/td>2<\/td>1<\/td>1<\/td>2<\/td>8<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Step 6: Add effects to table<\/h1>\n\n\n\n

\u2022 Read column by column and determine the effects<\/p>\n\n\n\n

\u2022 One effect can occur in multiple test combinations<\/p>\n\n\n\n

Cause\\Effects<\/td>1<\/td>2<\/td>3<\/td>4<\/td>5<\/td>6<\/td>7<\/td>8<\/td>9<\/td>10<\/td>11<\/td>12<\/td>13<\/td>14<\/td>15<\/td>16<\/td><\/td><\/tr>
C1(A,B,C,O)<\/td>A<\/td>A<\/td>A<\/td>A<\/td>B<\/td>B<\/td>B<\/td>B<\/td>C<\/td>C<\/td>C<\/td>C<\/td>O<\/td>O<\/td>O<\/td>O<\/td><\/td><\/tr>
C2(Yes\\No)<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td>Y<\/td>Y<\/td>N<\/td>N<\/td><\/td><\/tr>
C3(yes\\No)<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td>Y<\/td>N<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
E1: Normal letter<\/td>X<\/td>X<\/td>X<\/td>X<\/td>X<\/td>X<\/td>X<\/td>X<\/td><\/td><\/td><\/td><\/td>?<\/td>?<\/td>?<\/td>?<\/td><\/td><\/tr>
E2: Special Letter<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td>X<\/td>X<\/td>X<\/td>X<\/td>?<\/td>?<\/td>?<\/td>?<\/td><\/td><\/tr>
E3: Add paragraph<\/td>?<\/td>X<\/td>X<\/td><\/td>?<\/td>X<\/td>X<\/td><\/td>?<\/td>X<\/td>X<\/td><\/td>?<\/td>?<\/td>?<\/td>?<\/td><\/td><\/tr>
E4: No Letter<\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/td><\/tr>
Checksum<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>1<\/td>16<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

As we see in the above table after adding effects to the table you can:<\/p>\n\n\n\n

1-\u00a0Determine if you have a missing requirement or not as in the case we place \u201c?\u201d, the requirement is missing if the customer type is other than the 3 types A, B,C<\/p>\n\n\n\n

2-\u00a0You can determine if there is a redundant requirement, example in columns 6 and 7 by looking into the table you will find the 2 columns have the same effects, so you can ask the client or the analyst about this situation and if it doesn\u2019t matter to have a credit line or not in case of customer type B<\/p>\n\n\n\n

3-\u00a0Finally you will be sure that you cover all possible scenarios by doing this analysis.<\/p>\n\n\n\n

<\/p>\n\n\n\n

Finally, In QLeaders we help you to analyze your requirement to ensure the maximum coverage of the requirement in the testing <\/p>\n\n\n\n

QLeaders, Your Quality Gate!<\/p>\n\n\n\n

Ahmed Ibrahim.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

Introduction This article describes in detail an organized method to extract all possible cases from the requirement, this can help the system analyst in defining all the cases and also can help developers while preparing the unit TCs and of course will help the testers to write unified test cases. First of all, suppose you […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0},"categories":[1],"tags":[],"_links":{"self":[{"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/posts\/103"}],"collection":[{"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/comments?post=103"}],"version-history":[{"count":2,"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/posts\/103\/revisions"}],"predecessor-version":[{"id":107,"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/posts\/103\/revisions\/107"}],"wp:attachment":[{"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/media?parent=103"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/categories?post=103"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/qleaders.net\/index.php\/wp-json\/wp\/v2\/tags?post=103"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}