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
1.For a single module how many builds are possible 2.what will be the max or min time to finish up an single module
What are cookies?
How much the bug is affecting the functionality of the application?
negative test cases on banking domain ?
What’s the difference between verification and validation in testing?
What's the difference between system testing and acceptance testing?
What is test out put?
What are the main key components in web applications and client and server applications? And explain the differences between them?
Differentiate test bed and test environment?
what is your daily activities?
Define performance and stress testing?
how is market for testing in banglore,chennai,pune,delhi?
What is junit & api?
What are the different types of integration testing?
How to Generate Test Case for Shopping Cart?