Thursday, December 17, 2009

Correlation between Cyclometric Complexity & Code Coverage while doing White box testing

If you are among those testers (or developers) who have often wondered how cyclometric complexity can practically help me achieve higher code coverage and uncovering max number of bugs by executing minimum no. of unit test then please read on. I have tried to take a very simple example and have focussed on explaining the very basics with data and images only to make sure you can visualize and understand the differences between statement coverage, decision coverage and path coverage and their relationship with cyclometric complexity for once and all.

Pseudocode                                

Read a;

Read b;

if(a>=b)

         print  a

else

          print b

Do x;

if (a ==0)

        print “Zero”

do nothing;

 

Flow chart of the above pseudocode:

 

image

 

Cyclometric Complexity:

= E-N + 2P  (where E is no. of edges, N is the no. of node and P is the no. of connected components in the above graph)

= 10 – 9 + 2 x 1

= 3

Minimum Test Required for  100 % Statement coverage:

Unit Test #1:

Test data: a = 0, b = –1  (True & True)

cyclometric complexity_SC_Test1

Unit Test #2:

Test data = a =0, b = 2 (False & True)

Total  test required for 100 % statement coverage = 2

cyclometric complexity_SC_Test2

With the above two test cases we are able to execute each line of code at least once.

Minimum Test Required for 100 % Branch Coverage or Decision Coverage

Unit Test #1:

Test data: a = 0, b = –1    (True & True)

cyclometric complexity_SC_Test1

Unit Test #2:

Test data: a =1, b = 2  (False & False)

cyclometric complexity_bc_test1

Total  test required for 100 % branch coverage = 2

Minimum Test Required for 100 % Path Coverage (Basis Path Coverage)

Unit Test #1:

Test data: a = 0, b = –1  (True & True Input)

< same as scenario #1 of statement coverage>

cyclometric complexity_SC_Test1

Unit Test #2:

Test Data : a = 1, b =0  (True & False Input)

 cyclometric complexity_pc_t2

 

Unit Test #3

Test data:  a =0, b = 2 (False & True Input)

cyclometric complexity_pc_t3

Unit Test #4:

Test data:  a =1, b = 2  (False and False Input)

<same as Scenario #2 of branch coverage>

cyclometric complexity_bc_test1

Total  test required for 100 % path coverage = 4  (Which is also 2^2 choices where 2 is n decided by first IF-ELSE)

basically what we have done above can also be shown in the form the grid:

Input\Output First IF O/p of First IF    Second IF O/P of Second IF
a = 0, b = –1    True Print a  True Print 0
a = 1, b =0  True Print a  False     -
a =0, b = 2  False Print b  True print a
a =1, b = 2  False Print b  False -

Universal Formula:

Branch Coverage <=  Cyclometric Complexity <= Path Coverage

Replacing our values:

2 <= 3 <= 4 (holds good :))

Now what do we conclude by doing all this:

Does 100 % statement coverage ensures no bugs?

Answer is NO. 100% statement coverage just ensure every statement is executed at least once BUT it doesn’t guarantee that all the conditions are tested for different combination of data and hence it is not the most efficient method

Does 100 % branch coverage ensures no bugs?

Answer is again NO. 100 % branch coverage is certainly better than statement coverage and more efficient but it only ensures that each branch is executed at least once but again it doesn’t cover all the possible combinations  (like two Ifs can be tested with 2 branch test case for TT, FF where as total possible combination will be 4 (TT,TF,FT,FF) which are not getting covered here)

Which is the best way of ensuring 100 % code coverage.

Answer is Path Coverage (a.k.a. basis path testing). This is better than both statement and branch coverage. Though this is practically very impossible to cover all permutations and combinations (For ex when there are 2 IF statements, total paths are 2^2= 4 combination and as no. of Ifs in the program  goes to n, no of possible combination goes to 2^n)

Thats where cyclomertic complexity is used to find out the min test to be executed to achieve path coverage and the max test to be executed for branch coverage.

In above example, if the bug was in a condition when one first IF resulted into True (YES) and Second IF resulted into False (NO) then none statement coverage or branch coverage could find that bug and hence cyclometric complexity = 3 shows that adding one more scenario to branch coverage  as TF or FT (other than TT,FF) will help to uncover that bug so minimum 3 test are required to have high probability of uncovering bugs but max 4 test are required (max possible combinations) to ensure no bugs, which generally become impractical with the growing code containing multiple nested if-else and loops.

Here cyclometric complexity helps unit tester decides at least what are the min no. of test that should be executed to cover the scenarios which have high probability of finding bugs out of total possible scenarios of path coverage (Which is 2^n)

PS: I want to thank Renu (an enthusiastic tester) to bring this topic in our discussions which triggered this interest in me to link all these pieces and try giving an overall perspective to testers by taking this simple example.

Feel free to write your comments to have a discussion or to clarify a point if you disagree.

9 comments:

Prashant Rawat said...

very well explained.

Anonymous said...

Now, escorts can be contacted right from the comfort zone of your home - thanks to the easily navigable, user-friendly websites that present all escort activities and services online for your access.
They are the proud owners of the best physical features and they know what their clients want from them during a session.
Payment for your girl can be done online instantly. So, you should not have any sort of issue regarding anything.
Doing on work and not enjoying pleasures like kisses, touches and romance can make a person psychologically disturbed.
You can use New York independent Escort service for enjoying some time in the company of Bijou in New York.New York is the capital of West Bangal. With these girls, you will not feel you are getting some kind of service, the experience will be so real that it will almost like a real date.
[url=http://bijouescorts.com]New York Escorts[/url] The growing popularity of a New York escort agency has been the outcome of a number of factors. First, a New York based escort agency believes in offering only the most exciting range of escort fun. Secondly, the rates that such an escort agency charges always comes under one's budget. Thirdly, instant access of girls in and around New York has been another major contributing factor in its success.

The services offered by the hottest and glamorous ladies of New York are often admired because of their truly sensual companionship. The services offered are of superior level and may vary with different providers. The booking process is very easy and user friendly with many viable payment options available.
http://bijouescorts.com New York escorts are genuinely the best girlfriends for men seeking for pleasure. They are the abode of beauty and charm and satisfy men with their amazing sense of maturity. The top-quality escorts of New York are the finest and greatly enviable attractive girls who understand the need and desire of their customer. They are blessed with the most alluring bodies and with the superior set of soft skills; they can make anyone feel special.

Anonymous said...

hi all

I just thought it would be good to introduce myself to everyone!

Can't wait to get to know you all better!

-Marshall

Thanks again!

Anonymous said...

Howdy

I just wanted to say hi to everyone

See you

[URL=http://www.vpnclient.us][IMG]http://openvpn.net/archive/openvpn-users/2005-05/pngd55nFojmJX.png[/IMG][/URL]

Rajesh Chadha said...

Very well explained, indeed!

Anonymous said...

[url=http://www.bollywood-latest.com/]Bollywood Blog[/url]

[url=http://www.bollywood-latest.com/]Bollywood News[/url]

[url=http://www.bollywood-latest.com/]Bollywood Gossip[/url]

[url=http://www.bollywood-latest.com/]Bollywood Actress[/url]

Anonymous said...

hello


just registered and put on my todo list


hopefully this is just what im looking for looks like i have a lot to read.

James Marcus Bach said...

I'm surprised you haven't pointed out the obvious weakness in this test technique.

Are you going to say what remains untested even after you have covered every path? I could tell you, but I bet you know, already.

Raj said...

Yes James, I should have :). This ensures CODE COVERAGE and NOT REQUIREMENT OR TEST COVERAGE.

In other words, whatever is coded is RUNNING without failure BUT whatever is not remains a mystery and need to be tested by ensuring user needs and scenarios are addressed.

Hence Unit testing + Code Coverage is just one piece of the jigsaw puzzle. there is lot more to do other than this to ensure a sucessful high quality product