what is cyclomatic complexity? plz explain with example

Answer Posted / rahul

it is used to find out no. of independent path in graph.

v(g)=e-n+2p

v(g)=cyclomatic complexity of graph g
e=no.of edges in th graph
n=no. of node in tha graph
p=no.of connected component in the graph

Is This Answer Correct ?    2 Yes 3 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

when do you escalte issue to your manager?

1900


What ishigh severity, low priority bug?

800


How does your preferred work style work with the ideal test-manager role that you just described? What is different between the way you work and the role you described?

1794


hello there, can anyone tell me what type of question does lg soft company ask in written test especially for a quant part? Thanku

1494


How do you perform configuration management with typical revision control systems?

1737






After insert the record in front-end, how will you check the back end by manually? Please explain?

708


What is the test case?

735


Define what is a critical bug.

778


What is the negative testing and example

1078


What is the difference between three tier and two tier application?

753


what are the Cs in testing

1706


Can you explain the pdca cycle and where testing fits in?

879


what is TAS language which is used as a language for some projects/

1693


wat is test management ?what are the components available in test management?

1707


Tell some examples of bug severity and bug priority?

723