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
when do you escalte issue to your manager?
What ishigh severity, low priority bug?
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?
hello there, can anyone tell me what type of question does lg soft company ask in written test especially for a quant part? Thanku
How do you perform configuration management with typical revision control systems?
After insert the record in front-end, how will you check the back end by manually? Please explain?
What is the test case?
Define what is a critical bug.
What is the negative testing and example
What is the difference between three tier and two tier application?
what are the Cs in testing
Can you explain the pdca cycle and where testing fits in?
what is TAS language which is used as a language for some projects/
wat is test management ?what are the components available in test management?
Tell some examples of bug severity and bug priority?